Non-overlapping inversion on strings and languages

DOI10.1016/J.TCS.2015.05.008zbMath1330.68164OpenAlexW278179024MaRDI QIDQ500959

Yo-Sub Han, Hwee Kim

Publication date: 8 October 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.008

zbMATH Keywords

formal languagesfinite-state automatanon-overlapping inversion

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Rich words in the block reversal of a word ⋮ Block reversal on finite words

Cites Work

• Unnamed Item
• Efficient string-matching allowing for non-overlapping inversions
• 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)
• On Decidability and Closure Properties of Language Classes with Respect to Bio-operations
• Pseudo-inversion on Formal Languages
• A New Algorithm for the Characteristic String Problem under Loose Similarity Criteria
• Duplication in DNA Sequences
• Closure of Language Classes Under Bounded Duplication
• On Protein Structure Alignment under Distance Constraint
• String Matching with Involutions
• Approximate String Matching with Swap and Mismatch
• Turing machines with restricted memory access
• Developments in Language Theory
• Alignment with Non-overlapping Inversions on Two Strings
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Operations and language generating devices suggested by the genome evolution

This page was built for publication: Non-overlapping inversion on strings and languages