Pages that link to "Item:Q3657444"

The following pages link to An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules (Q3657444):

Displaying 40 items.

• A sum-over-paths extension of edit distances accounting for all sequence alignments (Q632613) (← links)
• The complexity of querying indefinite data about linearly ordered domains (Q676427) (← links)
• Properties of Levenshtein metrics on sequences (Q792096) (← links)
• General methods of sequence comparison (Q799527) (← links)
• A note on the evaluation of similarity (homology) of short sequences with long sequences (Q799608) (← links)
• Sequence matching with binary codes (Q911265) (← links)
• Distribution of the number of matches between nucleotide sequences (Q914581) (← links)
• A computationally efficient approximation to the nearest neighbor interchange metric (Q1057598) (← links)
• Optimized homology searches of the gene and protein sequence data banks (Q1085103) (← links)
• Significance levels for biological sequence comparison using non-linear similarity functions (Q1099106) (← links)
• Algorithms for the optimal identification of segment neighborhoods (Q1111966) (← links)
• Efficient methods for multiple sequence alignment with guaranteed error bounds (Q1203038) (← links)
• Constrained tree editing (Q1328503) (← links)
• Parametric optimization of sequence alignment (Q1336962) (← links)
• Sublinear approximate string matching and biological applications (Q1336963) (← links)
• Classes of cost functions for string edit distance (Q1355732) (← links)
• Constrained many-to-one string editing with memory (Q1358830) (← links)
• Similarity and dissimilarity in posets (Q1360674) (← links)
• Two applications of the divide \(\&\) conquer principle in the molecular sciences (Q1365048) (← links)
• Improving classifier performance through repeated sampling. (Q1373785) (← links)
• Learning local transductions is hard (Q1770836) (← links)
• Computing the similarity of two sequences with nested arc annotations (Q1884953) (← links)
• Comparing resemblance measures (Q1901395) (← links)
• Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
• Hierarchical multidimensional scaling for the comparison of musical performance styles (Q2078727) (← links)
• A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem (Q2117202) (← links)
• An \(A^\ast\) search algorithm for the constrained longest common subsequence problem (Q2224853) (← links)
• An algorithm for the sequence alignment with gap penalty problem using multiway divide-and-conquer and matrix transposition (Q2234794) (← links)
• A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance (Q2277233) (← links)
• An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search (Q2366996) (← links)
• A survey of temporal data mining (Q2371224) (← links)
• A time warping approach to multiple sequence alignment (Q2406175) (← links)
• A measure of DNA sequence similarity by Fourier transform with applications on hierarchical clustering (Q2415679) (← links)
• Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)
• Kernels for sequentially ordered data (Q4633041) (← links)
• Predicting Successful and Unsuccessful Transitions from School to Work by Using Sequence Methods (Q4785447) (← links)
• A genetic algorithm on multiple sequences alignment problems in biology (Q4789540) (← links)
• Large deviations-based upper bounds on the expected relative length of longest common subsequences (Q5395363) (← links)
• (Q5859848) (← links)
• Finite Approximations and Similarity of Languages (Q6169950) (← links)