Pages that link to "Item:Q4055158"
From MaRDI portal
The following pages link to An Extension of the String-to-String Correction Problem (Q4055158):
Displaying 37 items.
- Efficient special cases of pattern matching with swaps (Q293429) (← links)
- On the hardness of the consensus string problem (Q396596) (← links)
- Charge and reduce: A fixed-parameter algorithm for string-to-string correction (Q456695) (← links)
- Using swaps and deletes to make strings match (Q476911) (← links)
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- Approximate string matching with stuck address bits (Q551176) (← links)
- The approximate swap and mismatch edit distance (Q604463) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- Properties of Levenshtein metrics on sequences (Q792096) (← links)
- Automatic error correction in flexion languages (Q805262) (← links)
- A model and a fast algorithm for multiple errors spelling correction (Q808697) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Property matching and weighted matching (Q932325) (← links)
- Pattern matching with pair correlation distance (Q955040) (← links)
- Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350) (← links)
- Approximate string matching with address bit errors (Q1038472) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
- Probabilistic models of genome shuffling (Q1111971) (← links)
- A faster algorithm computing string edit distances (Q1140994) (← links)
- The string merging problem (Q1154285) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- Efficient algorithms for approximate string matching with swaps (Q1288533) (← links)
- Overlap matching. (Q1401926) (← links)
- Function approximation on non-Euclidean spaces (Q1763473) (← links)
- Approximate swapped matching. (Q1853034) (← links)
- Fast approximate matching of words against a dictionary (Q1895867) (← links)
- String matching with up to \(k\) swaps and mismatches (Q1959438) (← links)
- Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
- Swap and mismatch edit distance (Q2369878) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
- Adaptive Computation of the Swap-Insert Correction Distance (Q2949833) (← links)
- (Q3143773) (← links)
- Approximate String Matching with Address Bit Errors (Q3506947) (← links)
- A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance (Q5240425) (← links)
- Crossing Number of Graphs with Rotation Systems (Q5452204) (← links)
