( en | de | ru )

 

Disambiguation of "Välimäki, Niko"

Author of the publication

copydeleteadd this publication to your clipboard
Random projection based clustering for population genomics.

, , , , , , , and . IEEE BigData, page 675-682. IEEE Computer Society, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vesa Välimäki

Niko Näther

Entwicklung eines H_1tn2O_1tn2-Messverfahrens für die Überwachung der mikrobioziden Wirksamkeit bei der Sterilisation aseptischer Verpackungen. Uni Marburg, (2009)

Niko Oertel

Niko Paech

Niko Haberkorn

 

Other publications of authors with the same name

Space-Efficient Algorithms for Document Retrieval., and . CPM, volume 4580 of Lecture Notes in Computer Science, page 205-215. Springer, (2007)Exploration and retrieval of whole-metagenome sequencing samples., , , and . Bioinform., 30 (17): 2471-2479 (2014)Distributed String Mining for High-Throughput Sequencing Data., and . WABI, volume 7534 of Lecture Notes in Computer Science, page 441-452. Springer, (2012)Efficient Path Kernels for Reaction Function Prediction., , , and . BIOINFORMATICS, page 202-207. SciTePress, (2012)Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections., , , and . SPIRE, volume 5280 of Lecture Notes in Computer Science, page 164-175. Springer, (2008)Least Random Suffix/Prefix Matches in Output-Sensitive Time.. CPM, volume 7354 of Lecture Notes in Computer Science, page 269-279. Springer, (2012)Storage and Retrieval of Individual Genomes., , , and . RECOMB, volume 5541 of Lecture Notes in Computer Science, page 121-137. Springer, (2009)Space Efficient String Mining under Frequency Constraints., , and . ICDM, page 193-202. IEEE Computer Society, (2008)Scalable and Versatile k-mer Indexing for High-Throughput Sequencing Data., and . ISBRA, volume 7875 of Lecture Notes in Computer Science, page 237-248. Springer, (2013)Engineering a Compressed Suffix Tree Implementation., , , and . WEA, volume 4525 of Lecture Notes in Computer Science, page 217-228. Springer, (2007)