Forbidden Factors and Fragment Assembly
From MaRDI portal
Publication:3147023
DOI10.1051/ITA:2001132zbMATH Open1005.68122OpenAlexW2170509538MaRDI QIDQ3147023FDOQ3147023
M. Sciortino, Antonio Restivo, Filippo Mignosi
Publication date: 18 September 2002
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_6_565_0
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms on Strings, Trees and Sequences
- The smallest automaton recognizing the subwords of a text
- Words and forbidden factors
- Forbidden words in symbolic dynamics
- Approximate nearest neighbors and sequence comparison with block operations
- Recurrence and periodicity in infinite words from local periods
- Words, univalent factors, and boxes
Cited In (7)
- REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS
- On the distribution of characteristic parameters of words II
- MINIMAL FORBIDDEN PATTERNS OF MULTI-DIMENSIONAL SHIFTS
- Forbidden traces and forbidden subtraces
- Languages with mismatches
- Word assembly through minimal forbidden words
- Minimal absent words in rooted and unrooted trees
This page was built for publication: Forbidden Factors and Fragment Assembly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147023)
