( en | de | ru )

 

Disambiguation of "Salmela, Leena"

Author of the publication

copydeleteadd this publication to your clipboard
Chaining for accurate alignment of erroneous long reads to acyclic variation graphs.

, , , , and . Bioinform., (August 2023)

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.

Rita Maria Leenaerts

Leena Ferogh

Leena Suhl

Leena Rissanen

Leena Niemelä

 

Other publications of authors with the same name

Identification of Variant Compositions in Related Strains Without Reference., , and . AlCoB, volume 9702 of Lecture Notes in Computer Science, page 158-170. Springer, (2016)HGGA: hierarchical guided genome assembler., and . BMC Bioinform., 23 (1): 167 (2022)Indexing Variable Length Substrings for Exact and Approximate Matching., and . SPIRE, volume 5721 of Lecture Notes in Computer Science, page 214-221. Springer, (2009)Chaining for accurate alignment of erroneous long reads to acyclic variation graphs., , , , and . Bioinform., (August 2023)Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding., , and . CPM, volume 128 of LIPIcs, page 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Towards Automated Management of Compiler Assignments., , and . CSEDU (2), page 243-249. INSTICC Press, (2009)978-989-8111-82-1.Approximate String Matching with Reduced Alphabet., and . Algorithms and Applications, volume 6060 of Lecture Notes in Computer Science, page 210-220. Springer, (2010)ViQUF: De Novo Viral Quasispecies Reconstruction Using Unitig-Based Flow Networks., , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 20 (2): 1550-1562 (March 2023)Fast and Efficient Rmap Assembly Using the Bi-Labelled de Bruijn Graph., , , and . WABI, volume 172 of LIPIcs, page 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Approximate Boyer-Moore String Matching for Small Alphabets., , and . Algorithmica, 58 (3): 591-609 (2010)