Text searching allowing for inversions and translocations of factors

DOI10.1016/j.dam.2013.05.016zbMath1329.68308OpenAlexW2087885669MaRDI QIDQ496536

Simone Faro, Domenico Cantone, Emanuele Giaquinta

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.05.016

zbMATH Keywords

analysis of algorithmsapproximate string matchingcomputational biologytext processinginversions and translocations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Cites Work

• Efficient string-matching allowing for non-overlapping inversions
• Simple and efficient string matching with k mismatches
• The smallest automaton recognizing the subwords of a text
• Transducers and repetitions
• String matching with inversions and translocations in linear average time (most of the time)
• New and faster filters for multiple approximate string matching
• Unnamed Item
• Unnamed Item

This page was built for publication: Text searching allowing for inversions and translocations of factors