( en | de | ru )

 

Disambiguation of "Rivals, Eric"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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.

Isabelle Rivals

Ull Erich

Hauke Erichsen

Gerda Erich

Badrian Erich

 

Other publications of authors with the same name

A Survey On Algorithmic Aspects Of Tandem Repeats Evolution.. Int. J. Found. Comput. Sci., 15 (2): 225-257 (2004)A Guaranteed Compression Scheme for Repetitive DNA Sequences., , , and . Data Compression Conference, page 453. IEEE Computer Society, (1996)A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs., , , , and . CPM, volume 191 of LIPIcs, page 22:1-22:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On The Distribution Of The Number Of Missing Words In Random Texts., and . Comb. Probab. Comput., 12 (1): 73-87 (2003)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)Rearrangement Scenarios Guided by Chromatin Structure., , , and . RECOMB-CG, volume 10562 of Lecture Notes in Computer Science, page 141-155. Springer, (2017)mpscan: Fast Localisation of Multiple Reads in Genomes., , , , and . WABI, volume 5724 of Lecture Notes in Computer Science, page 246-260. Springer, (2009)Efficient Construction of Hierarchical Overlap Graphs., , , and . SPIRE, volume 12303 of Lecture Notes in Computer Science, page 277-290. Springer, (2020)Hardness results for the center and median string problems under the weighted and unweighted edit distances., and . J. Discrete Algorithms, 3 (2-4): 390-415 (2005)Hardness of Optimal Spaced Seed Design., and . CPM, volume 3537 of Lecture Notes in Computer Science, page 144-155. Springer, (2005)