scientific article; zbMATH DE number 910858

MaRDI QIDQ4886031zbMATH OpenFDO

Authors Gene Myers, Webb Miller

Publication date 4 November 1996

zbMATH Keywords

highest-scoring alignmentmultiple-sequence alignment algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• Multiple genome alignment: chaining algorithms revisited
• A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
• Alignment between two multiple alignments
• Linear-space algorithms that build local alignments from fragments
• The Multiple Sequence Alignment Problem in Biology

Cited in

(17)

• A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
• Aligning two fragmented sequences
• Linear-space algorithms that build local alignments from fragments
• Co-linear chaining with overlaps and gap costs
• An almost quadratic time algorithm for sparse spliced alignment
• Chaining algorithms for multiple genome comparison
• Fast Algorithms for Computing Tree LCS
• Multiple genome alignment: chaining algorithms revisited
• Monge properties of sequence alignment
• scientific article; zbMATH DE number 2119727 (Why is no real title available?)
• Sparse dynamic programming on DAGs with small width
• A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly
• Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
• Local multiple alignment via subgraph enumeration
• Sequence to graph alignment using gap-sensitive co-linear chaining
• Longest common substring with gaps and related problems
• Fast algorithms for computing tree LCS

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886031)