Combinatorial algorithms for DNA sequence assembly
type: Item
instance of: scholarly article
title: Combinatorial algorithms for DNA sequence assembly
zbMATH Open document ID: 0831.92013
DOI: 10.1007/BF01188580
published in: Algorithmica
publication date: 1996-02-12T00:00:00Z
Mathematics Subject Classification ID: 92C40
Mathematics Subject Classification ID: 92-08
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 819144
zbMATH Keywords: branch-and-bound algorithms
zbMATH Keywords: approximation algorithms
zbMATH Keywords: fragment assembly
zbMATH Keywords: sequence reconstruction
zbMATH Keywords: DNA sequence assembly
zbMATH Keywords: shortest common superstring problem
zbMATH Keywords: four-phase approach
zbMATH Keywords: sequencing error rates
zbMATH Keywords: multiple sequence alignment
author: John D. Kececioglu
author: Eugene W. Myers
MaRDI profile type: Publication
cites work: Linear approximation of shortest superstrings
cites work: A note on finding optimum branchings
cites work: Thek best spanning arborescences of a network
cites work: Longest common subsequences of two random sequences
cites work: Q4858439
cites work: The pairing heap: A new form of self-adjusting heap
cites work: Two Algorithms for Generating Weighted Spanning Trees in Order
cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
cites work: On finding minimal length superstrings
cites work: An efficient algorithm for the all pairs suffix-prefix problem
cites work: Q4003678
cites work: A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
cites work: Q3138909
cites work: Q3219752
cites work: Q3994364
cites work: Minimal Mutation Trees of Sequences
cites work: Q4509227
cites work: An Algorithm for Reconstructing Protein and RNA Sequences
cites work: A greedy approximation algorithm for constructing shortest common superstrings
cites work: Finding optimum branchings
cites work: Approximation algorithms for the shortest common superstring problem
cites work: A linear-time algorithm for finding approximate shortest common superstrings
Recommended article: An integer programming approach to DNA sequence assembly
Recommended article: A hybrid algorithm for the DNA sequencing problem
Recommended article: DNA sequence assembly involving an acyclic graph model
Recommended article: Q4252428
Recommended article: Algorithmic DNA Self-assembly
Recommended article: Q4952645
Recommended article: Q5715205
description: scientific article; zbMATH DE number 819144