DE eng

Search in the Catalogues and Directories

Hits 1 – 13 of 13

1
Faster Algorithms for Longest Common Substring ...
Charalampopoulos, Panagiotis; Kociumaka, Tomasz; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
2
Faster Algorithms for Longest Common Substring ...
BASE
Show details
3
Unary Words Have the Smallest Levenshtein k-Neighbourhoods
In: CPM 2020 - 31st Annual Symposium on Combinatorial Pattern Matching ; https://hal.inria.fr/hal-03085847 ; CPM 2020 - 31st Annual Symposium on Combinatorial Pattern Matching, Jun 2020, Copenhagen, Denmark. pp.1-12, ⟨10.4230/LIPIcs.CPM.2020.10⟩ (2020)
BASE
Show details
4
Unary Words Have the Smallest Levenshtein k-Neighbourhoods
Charalampopoulos, Panagiotis; Pissis, Solon P.; Radoszewski, Jakub. - : LIPIcs - Leibniz International Proceedings in Informatics. 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2020
BASE
Show details
5
Faster Approximate Pattern Matching: A Unified Approach ...
BASE
Show details
6
Repetition Detection in a Dynamic String
Amir, Amihood; Boneh, Itai; Charalampopoulos, Panagiotis. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual European Symposium on Algorithms (ESA 2019), 2019
BASE
Show details
7
Longest Common Substring Made Fully Dynamic
Amir, Amihood; Charalampopoulos, Panagiotis; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual European Symposium on Algorithms (ESA 2019), 2019
BASE
Show details
8
Repetition Detection in a Dynamic String ...
Amir, Amihood; Boneh, Itai; Charalampopoulos, Panagiotis. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2019
BASE
Show details
9
Longest Common Prefixes with $k$-Errors and Applications ...
BASE
Show details
10
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
11
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
12
Optimal Computation of Overabundant Words ...
BASE
Show details
13
Optimal Computation of Avoided Words ...
BASE
Show details

Catalogues
0
0
0
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
13
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern