Minimal absent words in rooted and unrooted trees
From MaRDI portal
Publication:6536250
DOI10.1007/978-3-030-32686-9_11zbMATH Open1539.68378MaRDI QIDQ6536250
Gabriele Fici, Paweł Gawrychowski
Publication date: 19 April 2024
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?)
- Automata and forbidden words
- Using minimal absent words to build phylogeny
- Words and forbidden factors
- A framework for space-efficient string kernels
- Minimal absent words in a sliding window and applications to on-line pattern matching
- Alignment-free sequence comparison using absent words
- Word assembly through minimal forbidden words
- Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
- Forbidden Factors and Fragment Assembly
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Minimal forbidden words and symbolic dynamics
- MINIMAL FORBIDDEN PATTERNS OF MULTI-DIMENSIONAL SHIFTS
- Minimal forbidden factors of circular words
- On extended special factors of a word
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)
