1 |
Longest Common Prefixes with $k$-Errors and Applications ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
Suffix Tree of Alignment: An Efficient Index for Similar Data ...
|
|
|
|
BASE
|
|
Show details
|
|
7 |
Order-Preserving Suffix Trees and Their Algorithmic Applications ...
|
|
|
|
BASE
|
|
Show details
|
|
9 |
Number of occurrences of powers in strings
|
|
|
|
In: ISSN: 0129-0541 ; International Journal of Foundations of Computer Science ; https://hal-upec-upem.archives-ouvertes.fr/hal-00693448 ; International Journal of Foundations of Computer Science, World Scientific Publishing, 2010, 21 (4), pp.535--547. ⟨10.1142/S0129054110007416⟩ (2010)
|
|
BASE
|
|
Show details
|
|
10 |
Optimal Prefix and Suffix Queries on Texts
|
|
|
|
In: ISSN: 0020-0190 ; Information Processing Letters ; https://hal-upec-upem.archives-ouvertes.fr/hal-00619725 ; Information Processing Letters, Elsevier, 2008, 108 (5), pp.320-325. ⟨10.1016/j.ipl.2008.05.027⟩ (2008)
|
|
BASE
|
|
Show details
|
|
13 |
Longest repeated motif with a block of don't cares
|
|
|
|
In: 6th Latin American Theoretical Informatics (LATIN'04) ; https://hal-upec-upem.archives-ouvertes.fr/hal-00619983 ; 6th Latin American Theoretical Informatics (LATIN'04), 2004, Buenos Aires, Argentina. pp.271-278, ⟨10.1007/978-3-540-24698-5_31⟩ (2004)
|
|
BASE
|
|
Show details
|
|
14 |
Optimal Cost Parallel Algorithms for Lexicographical Ordering
|
|
|
|
In: Department of Computer Science Technical Reports (1986)
|
|
BASE
|
|
Show details
|
|
|
|