Pages that link to "Item:Q1902464"
From MaRDI portal
The following pages link to Combinatorial algorithms for DNA sequence assembly (Q1902464):
Displaying 35 items.
- Approximate all-pairs suffix/prefix overlaps (Q418172) (← links)
- On the complexity of the Eulerian closed walk with precedence path constraints problem (Q441867) (← links)
- An integer programming approach to DNA sequence assembly (Q647296) (← links)
- Diagram processing: Computing with diagrams (Q814449) (← links)
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
- DNA sequence assembly involving an acyclic graph model (Q902714) (← links)
- On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- A \(2_3^2\) superstring approximation algorithm (Q1281759) (← links)
- Inferring a DNA sequence from erroneous copies (Q1390940) (← links)
- Algorithms for testing that sets of DNA words concatenate without secondary structure (Q1426841) (← links)
- Classification of de Bruijn-based labeled digraphs (Q1686053) (← links)
- Uniform words (Q1883404) (← links)
- Safety and completeness in flow decompositions for RNA assembly (Q2170145) (← links)
- Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats (Q2471049) (← links)
- DNA fragments assembly programs: A comparative study (Q2741496) (← links)
- Safe and Complete Contig Assembly Via Omnitigs (Q2814598) (← links)
- On the complexity of the Eulerian closed walk with precedence path constraints problem (Q2861508) (← links)
- An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs (Q3066156) (← links)
- Forbidden Factors and Fragment Assembly (Q3147023) (← links)
- (Q3198925) (← links)
- The Contig Assembly Problem and Its Algorithmic Solutions (Q3305536) (← links)
- Fuzzy Genome Sequence Assembly for Single and Environmental Genomes (Q3652849) (← links)
- Sequencing two DNA templates in five channels by digital compression. (Q4037619) (← links)
- An Eulerian path approach to DNA fragment assembly (Q4547675) (← links)
- On the distribution of characteristic parameters of words II (Q4800267) (← links)
- Practical lower and upper bounds for the Shortest Linear Superstring (Q5140730) (← links)
- PROBABILISTIC MODELING AND ANALYSIS OF DNA FRAGMENTATION (Q5230443) (← links)
- COVERS FROM TEMPLATES (Q5291308) (← links)
- Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms (Q5307502) (← links)
- Algorithms – ESA 2004 (Q5464571) (← links)
- Constraint Databases (Q5717756) (← links)
- Rearrangement of DNA fragments: a branch-and-cut algorithm. (Q5957304) (← links)
- On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)
- An index for sequencing reads based on the colored de Bruijn graph (Q6536263) (← links)
