1 citations · 1 across the 3 of their papers we have counts for
4 papers
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
Jacqueline W. Daykin, Richard Groult, Yannick Guesnet +6
A degenerate or indeterminate string on an alphabet is a sequence of non-empty subsets of . Given a degenerate string of length , we present a new method based on the…
FM-index of Alignment with Gaps
Joong Chae Na, Hyunjoon Kim, Seunghwan Min +5
Recently, a compressed index for similar strings, called the FM-index of alignment (FMA), has been proposed with the functionalities of pattern search and random access. The FMA is…
Linear-time Computation of Minimal Absent Words Using Suffix Array
Carl Barton, Alice Heliou, Laurent Mouchard +1
An absent word of a word y of length n is a word that does not occur in y. It is a minimal absent word if all its proper factors occur in y. Minimal absent words have been computed…
Suffix Tree of Alignment: An Efficient Index for Similar Data
Joong Chae Na, Heejin Park, Maxime Crochemore +4
We consider an index data structure for similar strings. The generalized suffix tree can be a solution for this. The generalized suffix tree of two strings and is a compact…