Block reversal on finite words
From MaRDI portal
Publication:2243589
Recommendations
Cites work
- A local algorithm for DNA sequence alignment with inversions
- A space-efficient algorithm for sequence alignment with inversions and reversals
- Alignment with non-overlapping inversions on two strings
- An efficient algorithm for computing non-overlapping inversion and transposition distance
- Block palindromes: a new generalization of palindromes
- Combinatorics of Compositions and Words
- Efficient string-matching allowing for non-overlapping inversions
- Heuristics for reversal distance between genomes with duplicated genes
- scientific article; zbMATH DE number 50943 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- Non-overlapping inversion on strings and languages
- On highly palindromic words
- On multiset of factors of a word
- On periodic properties of circular words
- Palindromic rich words and run-length encodings
- Reconstruction of a word from a multiset of its factors
- Sequence searching allowing for non-overlapping adjacent unbalanced translocations
- State complexity of cyclic shift
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Theta palindromes in theta conjugates
Cited in
(5)
This page was built for publication: Block reversal on finite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2243589)