Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Combinatorial algorithms on words"'
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The Lyndon factorization of a word has been largely studied and recently variants of it have been introduced and investigated with different motivations. In particular, the canonical inverse Lyndon factorization ICFL ( w ) of a word w, introduced in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b42387ffbeac6ea627a315f34b3782f
http://hdl.handle.net/10281/295802
http://hdl.handle.net/10281/295802
Publikováno v:
Language and Automata Theory and Applications
Language and Automata Theory and Applications ISBN: 9783030406073
LATA
Language and Automata Theory and Applications ISBN: 9783030406073
LATA
Lyndon words have been largely investigated and showned to be a useful tool to prove interesting combinatorial properties of words. In this paper we state new properties of both Lyndon and inverse Lyndon factorizations of a word $w$, with the aim of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9868d9a44eb1b2cac77b2f4c3509ee86
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Discrete Algorithms. 1(5-6):409-421
We consider the problem of fingerprinting text by sets of symbols. Specifically, if S is a string, of length n, over a finite, ordered alphabet Σ, and S' is a substring of S, then the fingerprint of S' is the subset φ of Σ of precisely the symbols
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57c21dd08ecbeab4e221fce8e4f1e711
Publikováno v:
International Journal of Foundations of Computer Science. 23:323-342
The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T, when disjoint local swaps in the pattern are allowed. In the Approximate Pattern Matching problem with Swaps one seeks, for every text location wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::830e3a278807dbac47836f892b7122de
https://doi.org/10.1142/s0129054112400151
https://doi.org/10.1142/s0129054112400151
Publikováno v:
Information and Computation. 181:57-74
We propose a new paradigm for string matching, namely structural matching. In structural matching, the text and pattern contents are not important. Rather, some areas in the text and pattern, such as intervals, are singled out. A "match" is a text lo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3aa9347c9d86367a750a16af6b95418a
https://doi.org/10.1016/s0890-5401(02)00035-4
https://doi.org/10.1016/s0890-5401(02)00035-4
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642102165
IWOCA
IWOCA
The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T, when disjoint local swaps in the pattern are allowed. In this paper, we present a new efficient algorithm for the Swap Matching problem with short
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59d53caa2ffa4a26f05044b8ca649e73
https://doi.org/10.1007/978-3-642-10217-2_24
https://doi.org/10.1007/978-3-642-10217-2_24
Autor:
Simone Faro, Domenico Cantone
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540958901
SOFSEM
SOFSEM
The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T , when disjoint local swaps in the pattern are allowed. In the Approximate Pattern Matching problem with Swaps one seeks, for every text location w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa33f378ffacedfb5da5ce6fb84604a7
https://doi.org/10.1007/978-3-540-95891-8_25
https://doi.org/10.1007/978-3-540-95891-8_25