Pages that link to "Item:Q5644001"
From MaRDI portal
The following pages link to Matching Sequences under Deletion/Insertion Constraints (Q5644001):
Displaying 30 items.
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- General methods of sequence comparison (Q799527) (← links)
- RNA secondary structures and their prediction (Q799529) (← links)
- Line geometries for sequence comparisons (Q800250) (← links)
- Optimal sequence alignment allowing for long gaps (Q912793) (← links)
- Distribution of the length of the longest common subsequence of two multi-state biological sequences (Q947262) (← links)
- The prediction of a protein and nucleic acid structure: Problems and prospects (Q1061043) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- Constrained string editing (Q1099954) (← links)
- Graph nodes and a definition of structural similarity (Q1103651) (← links)
- Dynamic programming algorithms for picture comparison (Q1112625) (← links)
- The string merging problem (Q1154285) (← links)
- A fast algorithm for the longest-common-subsequence problem (Q1155365) (← links)
- A note on some tree similarity measures (Q1166933) (← links)
- A survey of multiple sequence comparison methods (Q1191624) (← links)
- Matching code sequences utilizing context free quality measures (Q1218356) (← links)
- Some biological sequence metrics (Q1232251) (← links)
- The tree-to-tree editing problem (Q1251477) (← links)
- The parameterized complexity of sequence alignment and consensus (Q1367540) (← links)
- Approximate regular expression pattern matching with concave gap penalties (Q1894715) (← links)
- Super-pattern matching (Q1902473) (← links)
- Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547) (← links)
- Geometric ergodicity of a Metropolis-Hastings algorithm for Bayesian inference of phylogenetic branch lengths (Q2228245) (← links)
- A molecular sequence metric and evolutionary trees (Q2264629) (← links)
- An algorithm for the distance between two finite sequences (Q2264770) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
- SVM-BALSA: Remote homology detection based on Bayesian sequence alignment (Q2500352) (← links)
- Shortcuts, diversions, and maximal chains in partially ordered sets (Q2559393) (← links)
- Volume formula and growth rates of the balls of strings under the edit distances (Q6096340) (← links)
