Word assembly through minimal forbidden words

Authors:
Gabriele Fici;Filippo Mignosi;Antonio Restivo;Marinella Sciortino
Affiliations:
Dipartimento di Matematica e Applicazioni, Università di Palermo and Institut Gaspard-Monge, Université de Marne-la-Vallée, France and Dipartimento di Matematica e Applicazioni, Uni ...;Dipartimento di Informatica, Università di L'Aquila, Coppito di L'Aquila, Italy;Dipartimento di Matematica e Applicazioni, Università di Palermo, Palermo, Italy;Dipartimento di Matematica e Applicazioni, Università di Palermo, Palermo, Italy
Venue:
Theoretical Computer Science
Year:
2006

Citing 6
Cited 7

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Automata and forbidden words

Information Processing Letters
Words and special factors

Theoretical Computer Science
Words and forbidden factors

Theoretical Computer Science
Forbidden Factors and Fragment Assembly

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Computing forbidden words of regular languages

Fundamenta Informaticae - Special issue on computing patterns in strings

Languages with mismatches

Theoretical Computer Science
Reconstruction of a word from a multiset of its factors

Theoretical Computer Science
Combinatorics of Finite Words and Suffix Automata

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Length of minimal forbidden words on a stationary ergodic source

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Efficient reconstruction of RC-equivalent strings

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Special factors and the combinatorics of suffix and factor automata

Theoretical Computer Science
A linear algorithm for string reconstruction in the reverse complement equivalence model

Journal of Discrete Algorithms

Quantified Score

Hi-index	5.23

Visualization

Abstract

We give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant size starting from a finite set of factors of w verifying a suitable hypothesis. We use combinatorics techniques based on the minimal forbidden words, which have been introduced in previous papers. This improves a previous algorithm which worked under the assumption of stronger hypothesis.