Combinatorial algorithms for DNA sequence assembly
From MaRDI portal
Recommendations
- An integer programming approach to DNA sequence assembly
- A hybrid algorithm for the DNA sequencing problem
- DNA sequence assembly involving an acyclic graph model
- scientific article; zbMATH DE number 1305536
- Algorithmic DNA Self-assembly
- scientific article; zbMATH DE number 1445328
- scientific article; zbMATH DE number 2239908
Cites work
- scientific article; zbMATH DE number 432779 (Why is no real title available?)
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 41029 (Why is no real title available?)
- scientific article; zbMATH DE number 53467 (Why is no real title available?)
- scientific article; zbMATH DE number 1516705 (Why is no real title available?)
- scientific article; zbMATH DE number 826053 (Why is no real title available?)
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- A greedy approximation algorithm for constructing shortest common superstrings
- A linear-time algorithm for finding approximate shortest common superstrings
- A note on finding optimum branchings
- An Algorithm for Reconstructing Protein and RNA Sequences
- An efficient algorithm for the all pairs suffix-prefix problem
- Approximation algorithms for the shortest common superstring problem
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Finding optimum branchings
- Linear approximation of shortest superstrings
- Longest common subsequences of two random sequences
- Minimal Mutation Trees of Sequences
- On finding minimal length superstrings
- The pairing heap: A new form of self-adjusting heap
- Thek best spanning arborescences of a network
- Two Algorithms for Generating Weighted Spanning Trees in Order
Cited in
(42)- Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms
- An Eulerian path approach to DNA fragment assembly
- scientific article; zbMATH DE number 826053 (Why is no real title available?)
- scientific article; zbMATH DE number 1445328 (Why is no real title available?)
- Optimal prefix and suffix queries on texts
- Safe and complete contig assembly via omnitigs
- On the distribution of characteristic parameters of words II
- Forbidden Factors and Fragment Assembly
- Approximate all-pairs suffix/prefix overlaps
- Probabilistic modeling and analysis of DNA fragmentation
- On the complexity of the Eulerian closed walk with precedence path constraints problem
- Sequencing two DNA templates in five channels by digital compression.
- A 2_3² superstring approximation algorithm
- Algorithms for testing that sets of DNA words concatenate without secondary structure
- On the complexity of the Eulerian closed walk with precedence path constraints problem
- An efficient algorithm for chinese postman walk on bi-directed de Bruijn graphs
- Rearrangement of DNA fragments: a branch-and-cut algorithm.
- DNA sequence assembly involving an acyclic graph model
- scientific article; zbMATH DE number 2119751 (Why is no real title available?)
- Practical lower and upper bounds for the shortest linear superstring
- On the role of metaheuristic optimization in bioinformatics
- DNA fragments assembly programs: A comparative study
- An approach to correcting DNA sequencing error
- Minimax regret spanning arborescences under uncertain costs
- scientific article; zbMATH DE number 2089953 (Why is no real title available?)
- COVERS FROM TEMPLATES
- The sequence reconstruction problem
- Safety and completeness in flow decompositions for RNA assembly
- On the greedy algorithm for the shortest common superstring problem with reversals
- Uniform words
- Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats
- Constraint Databases
- An integer programming approach to DNA sequence assembly
- Classification of de Bruijn-based labeled digraphs
- DNA sequence assembly of \textit{Paenibacillus Shenyangensis}
- Fuzzy genome sequence assembly for single and environmental genomes
- An efficient algorithm for Chinese postman walk on bi-directed de Bruijn graphs
- Algorithms – ESA 2004
- scientific article; zbMATH DE number 4174378 (Why is no real title available?)
- The contig assembly problem and its algorithmic solutions
- An index for sequencing reads based on the colored de Bruijn graph
- Diagram processing: Computing with diagrams
This page was built for publication: Combinatorial algorithms for DNA sequence assembly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902464)
