| 1 |
Hierarchical Overlap Graph
|
|
|
|
In: ISSN: 0020-0190 ; Information Processing Letters ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01674319 ; Information Processing Letters, Elsevier, 2020, 155, pp.#105862. ⟨10.1016/j.ipl.2019.105862⟩ (2020)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
Full Compressed Affix Tree Representations
|
|
|
|
In: IEEE Data Compression Conference ; DCC: Data Compression Conference ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02093302 ; DCC: Data Compression Conference, IEEE, Apr 2017, Snowbird, UT, United States. pp.102-111, ⟨10.1109/DCC.2017.39⟩ ; http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7921793 (2017)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree
|
|
|
|
In: 9th International Conference on Language and Automata Theory and Applications ; LATA: Language and Automata Theory and Applications ; https://hal.archives-ouvertes.fr/hal-01955978 ; LATA: Language and Automata Theory and Applications, Mar 2015, Nice, France. pp.109-120, ⟨10.1007/978-3-319-15579-1_8⟩ ; http://grammars.grlmc.com/LATA2015/ (2015)
|
|
BASE
|
|
Show details
|
|
|
| 4 |
Reverse engineering of compact suffix trees and links: A novel algorithm
|
|
|
|
In: ISSN: 1570-8667 ; Journal of Discrete Algorithms ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01082098 ; Journal of Discrete Algorithms, Elsevier, 2014, StringMasters 2012 & 2013 Special Issue (Volume 1), 28, pp.9-22. ⟨10.1016/j.jda.2014.07.002⟩ (2014)
|
|
BASE
|
|
Show details
|
|
|
|
|
