Sequence comparison with concave weighting functions
From MaRDI portal
Recommendations
- Sequence comparison with mixed convex and concave costs
- Sequence comparison. Theory and methods
- An algorithm and applications to sequence alignment with weighted constraints
- Weighted measures based on maximizing deviation for alignment-free sequence comparison
- Approximate Matching in Weighted Sequences
- Theoretical Computer Science
- A new combinatorial approach to sequence comparison
- Bounds for parametric sequence comparison
- A multiple sequence comparison method
Cites work
- A linear space algorithm for computing maximal common subsequences
- Algorithms for approximate string matching
- Algorithms for computing evolutionary similarity measures with length independent gap penalties
- RNA secondary structures and their prediction
- Rapid dynamic programming algorithms for RNA secondary structure
- Some biological sequence metrics
- The Least Weight Subsequence Problem
Cited in
(36)- Variable length local decoding and alignment-free sequence comparison
- Approximate matching between a context-free grammar and a finite-state automaton
- Approximate matching of regular expressions
- Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions
- Application of max-plus algebra to biological sequence comparisons
- Speeding up dynamic programming with applications to molecular biology
- scientific article; zbMATH DE number 1945159 (Why is no real title available?)
- Bounds for parametric sequence comparison
- Sequence comparison with mixed convex and concave costs
- Summation test for gap penalties and strong law of the local alignment score
- Parametric optimization of sequence alignment
- A survey of multiple sequence comparison methods
- Set-spectrum method in structure comparison and the concept of topological kinship
- Approximate regular expression pattern matching with concave gap penalties
- Dynamic programming with convexity, concavity and sparsity
- A robust model for finding optimal evolutionary tree
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
- An O(NP) sequence comparison algorithm
- Reconstructing a history of recombinations from a set of sequences
- scientific article; zbMATH DE number 232493 (Why is no real title available?)
- Linear-space algorithms that build local alignments from fragments
- The Relative Inefficiency of Sequence Weights Approaches in Determining a Nucleotide Position Weight Matrix
- scientific article; zbMATH DE number 742991 (Why is no real title available?)
- A block recursive sequence alignment algorithm
- On the space complexity of some algorithms for sequence comparison
- Consistency of optimal sequence alignments
- Minimum message length encoding and the comparison of macromolecules
- Optimal sequence alignment allowing for long gaps
- Algorithms for computing evolutionary similarity measures with length independent gap penalties
- Line geometries for sequence comparisons
- Efficient optimal decomposition of a sequence into disjoint regions, each matched to some template in an inventory
- Identifying periodic occurrences of a template with applications to protein structure
- Constrained sequence alignment
- scientific article; zbMATH DE number 434724 (Why is no real title available?)
- The concave least-weight subsequence problem revisited
- Locally optimal subalignments using nonlinear similarity functions
This page was built for publication: Sequence comparison with concave weighting functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101364)
