Superstring Graph: A New Approach for Genome Assembly
From MaRDI portal
Publication:2830057
DOI10.1007/978-3-319-41168-2_4zbMath1480.92135OpenAlexW2506121776MaRDI QIDQ2830057
Gustavo Sacomoto, Eric Rivals, Bastien Cazaux
Publication date: 9 November 2016
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01446428/file/Cazaux-etal-assembly-superstring-AAIM-2016.pdf
Uses Software
Cites Work
- Unnamed Item
- The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings
- A greedy approximation algorithm for constructing shortest common superstrings
- On finding minimal length superstrings
- An efficient algorithm for the all pairs suffix-prefix problem
- A linear time algorithm for shortest cyclic cover of strings
- From Indexing Data Structures to de Bruijn Graphs
- Greedy in Approximation Algorithms