Text searching allowing for inversions and translocations of factors
From MaRDI portal
Publication:496536
Recommendations
- String matching with inversions and translocations in linear average time (most of the time)
- Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time
- Efficient string-matching allowing for non-overlapping inversions
- A graph theoretic model to solve the approximate string matching problem allowing for translocations
- A graph-theoretic model to solve the approximate string matching problem allowing for translocations
Cites work
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- Efficient string-matching allowing for non-overlapping inversions
- New and faster filters for multiple approximate string matching
- Simple and efficient string matching with k mismatches
- String matching with inversions and translocations in linear average time (most of the time)
- The smallest automaton recognizing the subwords of a text
- Transducers and repetitions
Cited in
(5)- Sequence searching allowing for non-overlapping adjacent unbalanced translocations
- A graph-theoretic model to solve the approximate string matching problem allowing for translocations
- String matching with inversions and translocations in linear average time (most of the time)
- String matching with involutions
- A graph theoretic model to solve the approximate string matching problem allowing for translocations
This page was built for publication: Text searching allowing for inversions and translocations of factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496536)