Block reversal on finite words

DOI10.1016/j.tcs.2021.06.046OpenAlexW3178788692MaRDI QIDQ2243589

Anuran Maity, Palak Pandoh, Kalpana Mahalingam, Rama Raghavan

Publication date: 11 November 2021

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

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

zbMATH Keywords

combinatorics of wordspalindromesconjugatesnon-overlapping inversionblock reversal

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Smallest and Largest Block Palindrome Factorizations ⋮ Rich words in the block reversal of a word

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient string-matching allowing for non-overlapping inversions
• Non-overlapping inversion on strings and languages
• Palindromic rich words and run-length encodings
• An efficient algorithm for computing non-overlapping inversion and transposition distance
• The equation \(a_ M=b^ Nc^ P\) in a free group
• On periodic properties of circular words
• Reconstruction of a word from a multiset of its factors
• On highly palindromic words
• A local algorithm for DNA sequence alignment with inversions
• A space-efficient algorithm for sequence alignment with inversions and reversals
• On multiset of factors of a word
• Theta palindromes in theta conjugates
• State complexity of cyclic shift
• Heuristics for Reversal Distance Between Genomes with Duplicated Genes
• Combinatorics of Compositions and Words
• Alignment with Non-overlapping Inversions on Two Strings
• Block palindromes: a new generalization of palindromes

This page was built for publication: Block reversal on finite words