The following pages link to (Q4509227):
Displayed 50 items.
- On the variance of the optimal alignments score for binary random words and an asymmetric scoring function (Q330635) (← links)
- In memoriam Joseph B. Kruskal 1928--2010 (Q358495) (← links)
- On the Varshamov-Tenengolts construction on binary strings (Q393366) (← links)
- The multiple sequence sets: Problem and heuristic algorithms (Q411226) (← links)
- Algorithms for finding a most similar subforest (Q538470) (← links)
- Alignment of trees -- an alternative to tree edit (Q673642) (← links)
- An algorithm for matching run-length coded strings (Q685867) (← links)
- A model of fixed activation time scheduling (Q762013) (← links)
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- Parametric multiple sequence alignment and phylogeny construction (Q876718) (← links)
- A large neighborhood search heuristic for the longest common subsequence problem (Q953288) (← links)
- A computationally efficient approximation to the nearest neighbor interchange metric (Q1057598) (← links)
- Maximal success durations for a semi-Markov process (Q1094005) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- Posets of shuffles (Q1112072) (← links)
- Dynamic programming algorithms for picture comparison (Q1112625) (← links)
- Matching patterns in strings subject to multi-linear transformations (Q1115200) (← links)
- Optimal canonization of all substrings of a string (Q1183603) (← links)
- Every binary pattern of length six is avoidable on the two-letter alphabet (Q1186515) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- String editing under a combination of constraints (Q1310955) (← links)
- The utilization of fuzzy sets in the recognition of imperfect strings (Q1311809) (← links)
- Using Hirschberg's algorithm to generate random alignments of strings (Q1336757) (← links)
- Algorithms for approximate graph matching (Q1357079) (← links)
- Block edit models for approximate string matching (Q1391305) (← links)
- A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132) (← links)
- Efficient algorithms for computing the inner edit distance of a regular language via transducers (Q1712004) (← links)
- Edit distance of run-length encoded strings. (Q1853090) (← links)
- Enumerative aspects of secondary structures (Q1877651) (← links)
- Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
- On posets of \(m\)-ary words (Q1917485) (← links)
- Partially local multi-way alignments (Q1993381) (← links)
- A bit-string longest-common-subsequence algorithm (Q1996891) (← links)
- Quick greedy computation for minimum common string partition (Q2015138) (← links)
- Comparison methods for branching and axillary flowering sequences (Q2177435) (← links)
- Exact mean computation in dynamic time warping spaces (Q2218328) (← links)
- Some results on mean square error for factor score prediction (Q2261032) (← links)
- Computing the edit distance of a regular language (Q2381500) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
- Logarithmic behavior of some combinatorial sequences (Q2483399) (← links)
- Finding longest increasing and common subsequences in streaming data (Q2498982) (← links)
- A central limit theorem for the length of the longest common subsequences in random words (Q2679696) (← links)
- Quick Greedy Computation for Minimum Common String Partitions (Q3011861) (← links)
- Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
- A SURVEY ON ALGORITHMIC ASPECTS OF TANDEM REPEATS EVOLUTION (Q3021996) (← links)
- MULTISCALE COMPARISON AND CLUSTERING OF THREE-DIMENSIONAL TRAJECTORIES BASED ON CURVATURE MAXIMA (Q3063631) (← links)
- (Q3143773) (← links)
- DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM (Q4532713) (← links)