Efficient algorithms for computing the edit distance with non-overlapping inversions
From MaRDI portal
Cites work
- A local algorithm for DNA sequence alignment with inversions
- A space-efficient algorithm for sequence alignment with inversions and reversals
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions
- A subquadratic algorithm for minimum palindromic factorization
- Alignment with non-overlapping inversions and translocations on two strings
- Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time
- An efficient algorithm for computing non-overlapping inversion and transposition distance
- Computing palindromic factorizations and palindromic covers on-line
- EERTREE: an efficient data structure for processing palindromes in strings
- Efficient string-matching allowing for non-overlapping inversions
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Fast Pattern Matching in Strings
- Genome Rearrangements and Sorting by Reversals
- scientific article; zbMATH DE number 5158525 (Why is no real title available?)
- scientific article; zbMATH DE number 2087046 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- Palindromic length in linear time
- String matching with inversions and translocations in linear average time (most of the time)
- The String-to-String Correction Problem
This page was built for publication: Efficient algorithms for computing the edit distance with non-overlapping inversions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346910)
