Efficient string-matching allowing for non-overlapping inversions
DOI10.1016/J.TCS.2012.06.009zbMATH Open1292.68178OpenAlexW2099839938MaRDI QIDQ390885FDOQ390885
Authors: Domenico Cantone, Salvatore Cristofaro, Simone Faro 
Publication date: 9 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.009
Recommendations
- Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time
- Speeding up transposition-invariant string matching
- Efficient parameterized string matching
- Practical algorithms for transposition-invariant string-matching
- Efficient comparison based string matching
- Efficient string matching with k mismatches
- String matching with involutions
- scientific article; zbMATH DE number 1962813
- String matching with inversions and translocations in linear average time (most of the time)
Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Algorithms on strings (68W32)
Cites Work
- Introduction to algorithms
- New and faster filters for multiple approximate string matching
- A local algorithm for DNA sequence alignment with inversions
- A space-efficient algorithm for sequence alignment with inversions and reversals
- String matching with inversions and translocations in linear average time (most of the time)
- Simple and efficient string matching with k mismatches
Cited In (16)
- Sequence searching allowing for non-overlapping adjacent unbalanced translocations
- Pseudo-inversion: closure properties and decidability
- String matching with involutions
- String matching with inversions and translocations in linear average time (most of the time)
- Block reversal on finite words
- Duplications and Pseudo-Duplications
- An efficient algorithm for computing non-overlapping inversion and transposition distance
- Efficient matching of biological sequences allowing for non-overlapping inversions
- Two-way string-matching
- State complexity of inversion operations
- Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time
- On pattern matching with \(k\) mismatches and few don't cares
- Text searching allowing for inversions and translocations of factors
- Alignment with non-overlapping inversions and translocations on two strings
- Non-overlapping inversion on strings and languages
- Rich words in the block reversal of a word
This page was built for publication: Efficient string-matching allowing for non-overlapping inversions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390885)
