scientific article; zbMATH DE number 910858
From MaRDI portal
zbMATH Open0849.68021MaRDI QIDQ4886031FDOQ4886031
Authors: Gene Myers, Webb Miller 
Publication date: 4 November 1996
Title of this publication is not available (Why is that?)
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
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)
Cited In (16)
- Monge properties of sequence alignment
- An almost quadratic time algorithm for sparse spliced alignment
- A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly
- Multiple genome alignment: chaining algorithms revisited
- Sequence to graph alignment using gap-sensitive co-linear chaining
- Fast algorithms for computing tree LCS
- A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
- Fast Algorithms for Computing Tree LCS
- Linear-space algorithms that build local alignments from fragments
- Aligning two fragmented sequences
- Local multiple alignment via subgraph enumeration
- Chaining algorithms for multiple genome comparison
- Sparse dynamic programming on DAGs with small width
- Co-linear chaining with overlaps and gap costs
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
- Title not available (Why is that?)
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)
