title: A heuristic managing errors for DNA sequencing.
abstract: BACKGROUND
  A new heuristic algorithm for solving DNA sequencing by hybridization problem with positive and negative errors.
  
  
  RESULTS
  A heuristic algorithm providing better solutions than algorithms known from the literature based on tabu search method.
authors.affiliation: Institute of Computing Science, Poznań University of Technology, 60-965 Poznań, Poland. blazewic@sol.put.poznan.pl
authors.forename: Jacek
authors.initials: J
authors.lastname: Błazewicz
authors.forename: Piotr
authors.initials: P
authors.lastname: Formanowicz
authors.forename: Frederic
authors.initials: F
authors.lastname: Guinand
authors.forename: Marta
authors.initials: M
authors.lastname: Kasprzak
mesh_terms: D000465:Algorithms; D001483:Base Sequence; D003198:Computer Simulation; D005189:False Positive Reactions; D008957:Models, Genetic; D008969:Molecular Sequence Data; D009693:Nucleic Acid Hybridization; D020411:Oligonucleotide Array Sequence Analysis / Q000706:statistics & numerical data*; D009841:Oligonucleotides / Q000235:genetics*; D015203:Reproducibility of Results; D012107:Research Design; D012680:Sensitivity and Specificity; D016415:Sequence Alignment; D017422:Sequence Analysis, DNA / Q000379:methods* / Q000706:statistics & numerical data*; D013269:Stochastic Processes
chemical_list: D009841:Oligonucleotides