Pages that link to "Item:Q4210080"
From MaRDI portal
The following pages link to All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings (Q4210080):
Displaying 41 items.
- Monge properties of sequence alignment (Q418004) (← links)
- Periodicity algorithms and a conjecture on overlaps in partial words (Q442242) (← links)
- Dynamic edit distance table under a general weighted cost function (Q491146) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- Implementing approximate regularities (Q815420) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- A dynamic edit distance table (Q876720) (← links)
- Mining approximate patterns with frequent locally optimal occurrences (Q906440) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- Semi-local longest common subsequences in subquadratic time (Q1002102) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- Sparse LCS common substring alignment (Q1029026) (← links)
- Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time (Q1029706) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- A substring-substring LCS data structure (Q1625599) (← links)
- On almost Monge all scores matrices (Q1755777) (← links)
- Tandem cyclic alignment (Q1764893) (← links)
- Discovering instances of poetic allusion from anthologies of classical Japanese poems (Q1870547) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- A fully compressed algorithm for computing the edit distance of run-length encoded strings (Q1939665) (← links)
- On the advice complexity of the online dominating set problem (Q1998864) (← links)
- Approximate periodicity (Q2343134) (← links)
- Efficient algorithms for finding interleaving relationship between sequences (Q2380070) (← links)
- An almost quadratic time algorithm for sparse spliced alignment (Q2429729) (← links)
- Efficient all path score computations on grid graphs (Q2437757) (← links)
- Linear time algorithm for the longest common repeat problem (Q2457296) (← links)
- An all-substrings common subsequence algorithm (Q2482100) (← links)
- A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)
- Two algorithms for LCS consecutive suffix alignment (Q2643733) (← links)
- Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions (Q3177340) (← links)
- Sequence Alignment Algorithms for Run-Length-Encoded Strings (Q3511343) (← links)
- Periodic String Comparison (Q3637113) (← links)
- Algorithms For Computing Approximate Repetitions In Musical Sequences (Q4780537) (← links)
- (Q5009573) (← links)
- (Q5140776) (← links)
- (Q5140779) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS (Q5714671) (← links)
- (Q5743390) (← links)
- Approximate periods of strings (Q5958136) (← links)
- Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)
