Minimal absent words in rooted and unrooted trees

DOI10.1007/978-3-030-32686-9_11MaRDI QIDQ6536250zbMATH OpenFDO

Authors Gabriele Fici, Paweł Gawrychowski

Publication date 19 April 2024

Full work available at URL https://doi.org/10.1007/978-3-030-32686-9_11

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• Using minimal absent words to build phylogeny
• Building phylogeny with minimal absent words
• Linear-time computation of generalized minimal absent words for multiple strings
• Combinatorics of minimal absent words for a sliding window
• Absent words in a sliding window with applications

Cites work

• Alignment-free sequence comparison using absent words
• Automata and forbidden words
• Computing DAWGs and minimal absent words in linear time for integer alphabets
• Forbidden Factors and Fragment Assembly
• scientific article; zbMATH DE number 1998341 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• scientific article; zbMATH DE number 1408358 (Why is no real title available?)
• Minimal absent words in a sliding window and applications to on-line pattern matching
• MINIMAL FORBIDDEN PATTERNS OF MULTI-DIMENSIONAL SHIFTS
• Minimal forbidden words and symbolic dynamics
• On extended special factors of a word
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Using minimal absent words to build phylogeny
• Versatile succinct representations of the bidirectional Burrows-Wheeler transform
• Word assembly through minimal forbidden words
• Words and forbidden factors

Cited in

(2)

• Combinatorics of minimal absent words for a sliding window
• Linear-time computation of generalized minimal absent words for multiple strings

This page was built for publication: Minimal absent words in rooted and unrooted trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536250)