Alignment-free sequence comparison using absent words
From MaRDI portal
Publication:1784946
DOI10.1016/j.ic.2018.06.002zbMath1400.68264arXiv1806.02718OpenAlexW2805439715WikidataQ129623427 ScholiaQ129623427MaRDI QIDQ1784946
Solon P. Pissis, Panagiotis Charalampopoulos, Gabriele Fici, Robert Mercaş, Maxime Crochemore
Publication date: 27 September 2018
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.02718
Related Items (11)
Combinatorics of minimal absent words for a sliding window ⋮ Internal shortest absent word queries in constant time and linear space ⋮ Reverse-Safe Text Indexing ⋮ Isometric words based on swap and mismatch distance ⋮ Fast detection of specific fragments against a set of sequences ⋮ Absent Subsequences in Words ⋮ Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets ⋮ Absent subsequences in words ⋮ Minimal forbidden factors of circular words ⋮ Absent words in a sliding window with applications ⋮ Constructing antidictionaries of long texts in output-sensitive space
Uses Software
Cites Work
- Automata and forbidden words
- Using minimal absent words to build phylogeny
- The longest common extension problem revisited and applications to approximate string searching
- On a cyclic string-to-string correction problem
- A linear-time algorithm for a special case of disjoint set union
- Comparison of phylogenetic trees
- Forbidden words in symbolic dynamics
- Words and forbidden factors
- Minimal absent words in a sliding window and applications to on-line pattern matching
- Indexing weighted sequences: neat and efficient
- Word assembly through minimal forbidden words
- Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
- Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
- Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Minimum Unique Substrings and Maximum Repeats
- Suffix Arrays: A New Method for On-Line String Searches
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- An Eulerian path approach to DNA fragment assembly
- Inducing the LCP-Array
- Algorithms on Strings
- Minimal forbidden factors of circular words
This page was built for publication: Alignment-free sequence comparison using absent words
