Pages that link to "Item:Q911767"
From MaRDI portal
The following pages link to On a cyclic string-to-string correction problem (Q911767):
Displaying 22 items.
- A fast algorithm for stereo matching (Q287131) (← links)
- Monge properties of sequence alignment (Q418004) (← links)
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- Computational geometric aspects of rhythm, melody, and voice-leading (Q733549) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time (Q1029706) (← links)
- An improved algorithm for solving the banded cyclic string-to-string correction problem (Q1129017) (← links)
- Efficient merged longest common subsequence algorithms for similar sequences (Q1686075) (← links)
- Tandem cyclic alignment (Q1764893) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Tree edit distance with gaps (Q1853686) (← links)
- Alignments of mitochondrial genome arrangements: applications to metazoan phylogeny (Q2202162) (← links)
- An all-substrings common subsequence algorithm (Q2482100) (← links)
- On hidden Markov models and cyclic strings for shape recognition (Q2629864) (← links)
- Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment (Q2948308) (← links)
- APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS (Q3021984) (← links)
- FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES (Q4931732) (← links)
- (Q5140768) (← links)
- Circular Sequence Comparison with q-grams (Q5283829) (← links)
- Crossing Number of Graphs with Rotation Systems (Q5452204) (← links)
- Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)
