Open Access
| Issue |
RAIRO-Theor. Inf. Appl.
Volume 59, 2025
Generation, enumeration and tiling
|
|
|---|---|---|
| Article Number | 20 | |
| Number of page(s) | 18 | |
| DOI | https://doi.org/10.1051/ita/2025020 | |
| Published online | 05 December 2025 | |
- K. Brinda, M. Baym and G. Kucherov, Simplitigs as an efficient and scalable representation of de Bruijn graphs. Genome Biol. 22 (2021). [Google Scholar]
- A. Cracco and A.I. Tomescu, Extremely fast construction and querying of compacted and colored de Bruijn graphs with ggcat. Genome Res. 33 (2023) 1198-1207. [Google Scholar]
- S. Schmidt, S. Khan, J.N. Alanko, G.E. Pibiri and A.I. Tomescu, Matchtigs: minimum plain text representation of k-mer sets. Genome Biol. 24 (2023) 136. [Google Scholar]
- S. Schmidt and J.N. Alanko, Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. Algorithms Mol. Biol. 18 (2023) 5. [Google Scholar]
- E. Rossignolo and M. Comin, Ustar: improved compression of k-mer sets with counters using de Bruijn graphs, in International Symposium on Bioinformatics Research and Applications (ISBRA) (2023) 202-213. [Google Scholar]
- A. Rahman, R. Chikhi and P. Medvedev, Disk compression of k-mer sets. Algorithms Mol. Biol. 16 (2021). [Google Scholar]
- T. Panyukova, Eulerian cover with ordered enclosing for flat graphs. Electron. Notes Discrete Math. 28 (2007) 17-24. [Google Scholar]
- P. Ferragina, T. Gagie and G. Manzini, Lightweight data indexing and compression in external memory. Algorithmica 63 (2012) 707-730. [Google Scholar]
- L. da F Costa, An introduction to multisets. arXiv preprint arXiv:2110.12902 (2021). [Google Scholar]
- Md.S. Rahman, et al., Basic Graph Theory, vol. 9. Springer (2017). [Google Scholar]
- D. Kempa and T. Kociumaka, Resolution of the Burrows-Wheeler transform conjecture. Commun. ACM 65 (2022) 91-98. [Google Scholar]
- H. Bannai, J. Karkkainen, D. Köppl and M. Piatkowski, Constructing the bijective and the extended Burrows-Wheeler transform in linear time, in 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), vol. 191 of Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl-Leibniz-Zentrum für Informatik 7 (2021) 1-77:13. [Google Scholar]
- J.W Bentley, D. Gibney and S.V. Thankachan, On the complexity of BWT-Runs minimization via alphabet reordering, in 28th Annual European Symposium on Algorithms (ESA 2020), Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2020) 15:1-15:13. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.