( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Complexity of String Matching for Graphs.

, , , и . ICALP, том 132 из LIPIcs, стр. 55:1-55:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Harri Mäkinen

Veli Bicer

Veli Kartal

Veli Girgin

Larisa Veli

 

Другие публикации лиц с тем же именем

MetaFlow: Metagenomic Profiling Based on Whole-Genome Coverage Analysis with Min-Cost Flows., , и . RECOMB, том 9649 из Lecture Notes in Computer Science, стр. 111-121. Springer, (2016)Compressed representations of sequences and full-text indexes., , , и . ACM Trans. Algorithms, 3 (2): 20 (2007)Bit-parallel sequence-to-graph alignment., , и . Bioinform., 35 (19): 3599-3607 (2019)Missing pattern discovery., , , и . J. Discrete Algorithms, 9 (2): 153-165 (2011)Compact Suffix Array.. CPM, том 1848 из Lecture Notes in Computer Science, стр. 305-319. Springer, (2000)Linear Time Maximum Segmentation Problems in Column Stream Model., , , и . SPIRE, том 11811 из Lecture Notes in Computer Science, стр. 322-336. Springer, (2019)On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy., , , , и . BIOINFORMATICS, стр. 272-277. SciTePress, (2016)Chaining with Overlaps Revisited., и . CPM, том 161 из LIPIcs, стр. 25:1-25:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Evaluating approaches to find exon chains based on long reads., , и . Briefings Bioinform., 19 (3): 404-414 (2018)Flexible music retrieval in sublinear time., , и . Stringology, стр. 174-189. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2005)