Zobrazeno 1 - 10
of 265
pro vyhledávání: '"Longest common extension"'
Autor:
Kosolobov, Dmitry
The longest common extension problem is to preprocess a given string of length $n$ into a data structure that uses $S(n)$ bits on top of the input and answers in $T(n)$ time the queries $\mathit{LCE}(i,j)$ computing the length of the longest string t
Externí odkaz:
http://arxiv.org/abs/1611.02891
Longest common extension queries (often called longest common prefix queries) constitute a fundamental building block in multiple string algorithms, for example computing runs and approximate pattern matching. We show that a sequence of $q$ LCE queri
Externí odkaz:
http://arxiv.org/abs/1602.00447
Autor:
Bollobás, Béla, Letzter, Shoham
Publikováno v:
In European Journal of Combinatorics February 2018 68:242-248
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:
In Journal of Discrete Algorithms 2010 8(4):418-428
Autor:
Dmitry Kosolobov
The longest common extension problem is to preprocess a given string of length $n$ into a data structure that uses $S(n)$ bits on top of the input and answers in $T(n)$ time the queries $\mathit{LCE}(i,j)$ computing the length of the longest string t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7019114409c5f2f910dba10e06e5828a
http://hdl.handle.net/10138/307544
http://hdl.handle.net/10138/307544
Autor:
Shoham Letzter, Bla Bollobs
Publikováno v:
European Journal of Combinatorics, 68
Given a word w of length n and i,j[n], the longest common extension is the longest substring starting at both i and j. In this note we estimate the average length of the longest common extension over all words w and all pairs (i,j), as well as the ty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5d7c8a328ed2e2408541a67da3fcd6e
https://doi.org/10.1016/j.ejc.2017.07.019
https://doi.org/10.1016/j.ejc.2017.07.019
Publikováno v:
Journal of Discrete Algorithms. 8:418-428
The Longest Common Extension (LCE) problem considers a string s and computes, for each pair (i,j), the longest substring of s that starts at both i and j. It appears as a subproblem in many fundamental string problems and can be solved by linear-time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14301a910336e9b83b4c9a36e013386c
https://doi.org/10.1016/j.jda.2010.08.004
https://doi.org/10.1016/j.jda.2010.08.004
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.
Autor:
Liviu Tinta, Lucian Ilie
Publikováno v:
String Processing and Information Retrieval ISBN: 9783642037832
SPIRE
SPIRE
The Longest Common Extension problem considers a string s and computes, for each of a number of pairs (i ,j ), the longest substring of s that starts at both i and j . It appears as a subproblem in many fundamental string problems and can be solved b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4149cd19074ff2b5ebe97e7e95a988c0
https://doi.org/10.1007/978-3-642-03784-9_30
https://doi.org/10.1007/978-3-642-03784-9_30