Fast detection of specific fragments against a set of sequences

DOI10.1007/978-3-031-33264-7_5arXiv2208.03451MaRDI QIDQ6067326

Maxime Crochemore, Marie-Pierre Béal

Publication date: 16 November 2023

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.03451

zbMATH Keywords

minimal forbidden wordspecific wordSuffix Automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Automata and forbidden words
• Using minimal absent words to build phylogeny
• Forbidden words in symbolic dynamics
• Alignment-free sequence comparison using absent words
• Transducers and repetitions
• Can formal languages help pangenomics to represent and analyze multiple genomes?
• Absent words in a sliding window with applications
• Suffix Arrays: A New Method for On-Line String Searches
• Algorithms on Strings, Trees and Sequences
• Complete inverted files for efficient text retrieval and analysis
• Algorithms on Strings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast detection of specific fragments against a set of sequences