DE eng

Search in the Catalogues and Directories

Hits 1 – 14 of 14

1
Longest Common Prefixes with $k$-Errors and Applications ...
BASE
Show details
2
Optimal Computation of Overabundant Words
Almirantis, Yannis; Charalampopoulos, Panagiotis; Gao, Jia. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 17th International Workshop on Algorithms in Bioinformatics (WABI 2017), 2017
BASE
Show details
3
Optimal Computation of Overabundant Words ...
Almirantis, Yannis; Charalampopoulos, Panagiotis; Gao, Jia. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2017
BASE
Show details
4
Optimal Computation of Overabundant Words ...
BASE
Show details
5
Optimal Computation of Avoided Words ...
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
8
New complexity results for the k-covers problem
In: Information sciences. - New York, NY : Elsevier Science Inc. 181 (2011) 12, 2571-2575
OLC Linguistik
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
11
All maximal-pairs in step–leap representation of melodic sequence
In: Information sciences. - New York, NY : Elsevier Science Inc. 177 (2007) 9, 1954
OLC Linguistik
Show details
12
Computing the λ-covers of a string
In: Information sciences. - New York, NY : Elsevier Science Inc. 177 (2007) 19, 3957
OLC Linguistik
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

Catalogues
0
0
3
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
11
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern