Witold Remigiusz Rudnicki

Prof. Witold Remigiusz Rudnicki


Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2010
Verified
Journal Article
Open access
MKMiron Kursa
Miron Kursa
WRWitold Remigiusz Rudnicki
Witold Remigiusz Rudnicki
Feature Selection with the Boruta Package

1 January 2010 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
MKMiron Kursa
Miron Kursa
AJAleksander Jankowski
Aleksander Jankowski
WRWitold Remigiusz Rudnicki
Witold Remigiusz Rudnicki
Machine learning methods are often used to classify objects described by hundreds of attributes; in many applications of this kind a great fraction of attributes may be totally irrelevant to the classification problem. Even more, usually one cannot decide a priori which attributes are relevant. In this paper we present an improved version of the algorithm for identification of the full set of truly important variables in an information system. It is an extension of the random forest method which utilises the importance measure generated by the original algorithm. It compares, in the iterative fashion, the importances of original attributes with importances of their randomised copies. We analyse performance of the algorithm on several examples of synthetic data, as well as on a biologically important problem, namely on identification of the sequence motifs that are important for aptameric activity of short RNA sequences.

1 January 2017 in The Lancet Oncology
Verified
Journal Article
Closed access
JGJustin Guinney
Justin Guinney
TWTao Wang
Tao Wang
TLTeemu D Laajala
Teemu D Laajala
KWKimberly Kanigel Winner
Kimberly Kanigel Winner
JBJ Christopher Bare
J Christopher Bare
YZYuxin Zhu
Yuxin Zhu

1 May 2009
Verified
Conference Paper
Closed access
LLLukasz Ligowski
Lukasz Ligowski
WRWitold Remigiusz Rudnicki
Witold Remigiusz Rudnicki
The Smith Waterman algorithm for sequence alignment is one of the main tools of bioinformatics. It is used for sequence similarity searches and alignment of similar sequences. The high end graphical processing unit (GPU), used for processing graphics on desktop computers, deliver computational capabilities exceeding those of CPUs by an order of magnitude. Recently these capabilities became accessible for general purpose computations thanks to CUDA programming environment on Nvidia GPUs and ATI Stream Computing environment on ATI GPUs. Here we present an efficient implementation of the Smith Waterman algorithm on the Nvidia GPU. The algorithm achieves more than 3.5 times higher per core performance than previously published implementation of the Smith Waterman algorithm on GPU, reaching more than 70% of theoretical hardware performance. The differences between current and earlier approaches are described showing the example for writing efficient code on GPU.

23 March 2006 in Cancer Chemotherapy and Pharmacology
Verified
Journal Article
Closed access
PDF file
TLTheodore J. Lampidis
Theodore J. Lampidis
MKMetin Kurtoglu
Metin Kurtoglu
JMJohnathan C. Maher
Johnathan C. Maher
HLHuaping Liu
Huaping Liu
AKAwtar Krishan
Awtar Krishan
WPWaldemar Priebe
Waldemar Priebe

31 December 2014
Verified
Book Chapter
Closed access
PDF file
WRWitold Remigiusz Rudnicki
Witold Remigiusz Rudnicki
MWMariusz Wrzesień
Mariusz Wrzesień
WPWieslaw Paja
Wieslaw Paja