Linear-space algorithms that build local alignments from fragments
From MaRDI portal
Recommendations
- A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
- APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS
- Publication:4886031
- A time-efficient, linar-space local similarity algorithm
- Multiple genome alignment: chaining algorithms revisited
Cites work
- A linear space algorithm for computing maximal common subsequences
- A time-efficient, linar-space local similarity algorithm
- An \(O(N^ 2 \log N)\) restriction map comparison and search algorithm
- Constrained sequence alignment
- Dynamic programming with convexity, concavity and sparsity
- Pattern recognition in genetic sequences by mismatch density
- Sequence comparison with concave weighting functions
- Sparse dynamic programming I
- Sparse dynamic programming II
- Speeding up dynamic programming with applications to molecular biology
- The Context Dependent Comparison of Biological Sequences
- The String-to-String Correction Problem
Cited in
(22)- Locally optimal subalignments using nonlinear similarity functions
- A time-efficient, linar-space local similarity algorithm
- On computing all suboptimal alignments
- A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
- Aligning two fragmented sequences
- Co-linear chaining with overlaps and gap costs
- An almost quadratic time algorithm for sparse spliced alignment
- Chaining algorithms for multiple genome comparison
- A versatile divide and conquer technique for optimal string alignment
- A block recursive sequence alignment algorithm
- APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS
- scientific article; zbMATH DE number 2086217 (Why is no real title available?)
- Multiple genome alignment: chaining algorithms revisited
- scientific article; zbMATH DE number 1945159 (Why is no real title available?)
- Computing and Combinatorics
- scientific article; zbMATH DE number 2087038 (Why is no real title available?)
- scientific article; zbMATH DE number 910858 (Why is no real title available?)
- An Eulerian path approach to local multiple alignment for DNA sequences
- Avoiding ambiguity and assessing uniqueness in minisatellite alignment
- Efficient algorithms for local alignment search
- Local multiple alignment via subgraph enumeration
- An efficient alignment algorithm for masked sequences
This page was built for publication: Linear-space algorithms that build local alignments from fragments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902469)
