Pages that link to "Item:Q1101364"
From MaRDI portal
The following pages link to Sequence comparison with concave weighting functions (Q1101364):
Displaying 31 items.
- Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
- Summation test for gap penalties and strong law of the local alignment score (Q558686) (← links)
- Variable length local decoding and alignment-free sequence comparison (Q690447) (← links)
- Line geometries for sequence comparisons (Q800250) (← links)
- Algorithms for computing evolutionary similarity measures with length independent gap penalties (Q800252) (← links)
- An O(NP) sequence comparison algorithm (Q912628) (← links)
- Minimum message length encoding and the comparison of macromolecules (Q912791) (← links)
- Optimal sequence alignment allowing for long gaps (Q912793) (← links)
- Consistency of optimal sequence alignments (Q912794) (← links)
- Locally optimal subalignments using nonlinear similarity functions (Q1090289) (← links)
- Approximate matching of regular expressions (Q1119025) (← links)
- Speeding up dynamic programming with applications to molecular biology (Q1121182) (← links)
- On the space complexity of some algorithms for sequence comparison (Q1184980) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- A survey of multiple sequence comparison methods (Q1191624) (← links)
- Efficient optimal decomposition of a sequence into disjoint regions, each matched to some template in an inventory (Q1205301) (← links)
- Identifying periodic occurrences of a template with applications to protein structure (Q1209310) (← links)
- Constrained sequence alignment (Q1209899) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- Parametric optimization of sequence alignment (Q1336962) (← links)
- Bounds for parametric sequence comparison (Q1602688) (← links)
- Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions (Q1868715) (← links)
- Application of max-plus algebra to biological sequence comparisons (Q1870593) (← links)
- Approximate regular expression pattern matching with concave gap penalties (Q1894715) (← links)
- Linear-space algorithms that build local alignments from fragments (Q1902469) (← links)
- A robust model for finding optimal evolutionary tree (Q1902471) (← links)
- Set-spectrum method in structure comparison and the concept of topological kinship (Q2641243) (← links)
- Sequence comparison with mixed convex and concave costs (Q3493226) (← links)
- The concave least-weight subsequence problem revisited (Q3796787) (← links)
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs (Q5056152) (← links)
- The dynamic lot-sizing model with backlogging: A simple \(O(n\log n)\) algorithm and minimal forecast horizon procedure (Q5287175) (← links)
