Application of suffix trees for the acquisition of common motifs with gaps in a set of strings

Autor: Antoniou, Pavlos, Crochemore, Maxime, Iliopoulos, Costas, Peterlongo, Pierre

Publikováno v: International Conference on Language and Automata Theory and Applications
International Conference on Language and Automata Theory and Applications, Mar 2007, Tarragona, Spain

International audience; The inference of common motifs in a set of strings is a well-known problem with many applications in biological sciences. We study a new variant of this problem that oers a solution with the added exibility in the length of th

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::edc3ecc122e738cef8355886be19ade5
https://hal.inria.fr/inria-00328081/document

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees

Autor: Dominik Köppl

Publikováno v: Algorithms, Vol 14, Iss 2, p 44 (2021)

We present algorithms computing the non-overlapping Lempel–Ziv-77 factorization and the longest previous non-overlapping factor table within small space in linear or near-linear time with the help of modern suffix tree representations fitting into

Externí odkaz: https://doaj.org/article/5a609c2adb3946c9bc8d5815e0a16bf5

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Size-constrained Weighted Ancestors with Applications

Autor: Bille, Philip, Nekrich, Yakov, Pissis, Solon P.

The weighted ancestor problem on a rooted node-weighted tree $T$ is a generalization of the classic predecessor problem: construct a data structure for a set of integers that supports fast predecessor queries. Both problems are known to require $\Ome

Externí odkaz: http://arxiv.org/abs/2311.15777