DNA Sequencing—Tabu and Scatter Search Combined

References

• Bains W., Smith G. C. A novel method for nucleic acid sequence determination. J. Theoret. Biol. (1988) 135:303–307Crossref, Google Scholar
• Błażewicz J., Formanowicz P., Glover F., Kasprzak M., Węglarz J., Celso C. Ribeiro. An improved tabu search algorithm for DNA sequencing with errors. Proc. III Metaheuristics Internat. Conf. MIC'99, Angra dos Reis, July 1999 (1999a) 69–75Catholic University of Rio de Janeiro, Rio de Janeiro, BrazilGoogle Scholar
• Błażewicz J., Formanowicz P., Kasprzak M., Markiewicz W. T., Węglarz J. DNA sequencing with positive and negative errors. J. Comput. Biol. (1999b) 6:113–123Crossref, Google Scholar
• Błażewicz J., Formanowicz P., Kasprzak M., Markiewicz W. T., Węglarz J. Tabu search for DNA sequencing with false negatives and false positives. Eur. J. Oper. Res. (2000) 125:257–265Crossref, Google Scholar
• Błażewicz J., Kaczmarek J., Kasprzak M., Markiewicz W. T., Węglarz J. Sequential and parallel algorithms for DNA sequencing. Comput. Appl. Biosci. (1997) 13:151–158Google Scholar
• Błażewicz J., Kasprzak M. Complexity of DNA sequencing by hybridization. Theoret. Comput. Sci. (2003) 290:1459–1473Crossref, Google Scholar
• Błażewicz J., Kasprzak M., Kuroczycki W. Hybrid genetic algorithm for DNA sequencing with errors. J. Heuristic (2002) 8:495–502Crossref, Google Scholar
• Drmanac R., Labat I., Brukner I., Crkvenjakov R. Sequencing of megabase plus DNA by hybridization: Theory of the method. Genomics (1989) 4:114–128Crossref, Google Scholar
• Drmanac R., Labat I., Crkvenjakov R. An algorithm for the DNA sequence generation from k-tuple word contents of the minimal number of random fragments. J. Biomolecular Structure Dynam. (1991) 8:1085–1102Crossref, Google Scholar
• Fodor S. P. A., Read J. L., Pirrung M. C., Stryer L., Lu A. T., Solas D. Light-directed, spatially addressable parallel chemical synthesis. Science (1991) 251:767–773Crossref, Google Scholar
• Glover F. Heuristics for integer programming using surrogate constraints. Dec. Sci. (1977) 8:156–166Crossref, Google Scholar
• Glover F. Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Appl. Math. (1994) 49:231–255Crossref, Google Scholar
• Glover F., Corne D., Dorigo M., Glover F. Scatter search and path relinking. New Ideas in Optimization (1999) (McGraw-Hill, New York) 297–316Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Glover F., Laguna M., Marti R. Fundamentals of scatter search and path relinking. Control Cybernetics (2000) 29:653–684Google Scholar
• Hagstrom J. N., Hagstrom R., Overbeek R., Price M., Schrage L. Maximum likelihood genetic sequence reconstruction from oligo content. Networks (1994) 24:297–302Crossref, Google Scholar
• Halperin E., Halperin S., Hartman T., Shamir R. Handling long targets and errors in sequencing by hybridization. Proc. 6th Annual Internat. Conf. Res. Comput. Molecular Biol. RECOMB (2002) Washington D.C.:176–185April 2002Crossref, Google Scholar
• Lipshutz R. J. Likelihood DNA sequencing by hybridization. J. Biomolecular Structure Dynam. (1993) 11:637–653Crossref, Google Scholar
• Lysov Y. P., Florentiev V. L., Khorlin A. A., Khrapko K. R., Shik V. V., Mirzabekov A. D. Determination of the nucleotide sequence of DNA using hybridization with oligonucleotides. A new method. Dokl. Akad. Nauk SSSR (1988) 303:1508–1511Google Scholar
• Pease A. C., Solas D., Sullivan E. J., Cronin M. T., Holmes C. P., Fodor S. P. A. Light-generated oligonucleotide arrays for rapid DNA sequence analysis. Proc. National Acad. Sci. USA (1994) 91:5022–5026Crossref, Google Scholar
• Pevzner P. A. l-Tuple DNA sequencing: Computer analysis. J. Biomolecular Structure Dynam. (1989) 7:63–73Crossref, Google Scholar
• Southern E. M. (1988) . United Kingdom Patent Application GB8810400Google Scholar
• Waterman M. S.Introduction to Computational Biology. Maps, Sequences and Genomes (1995) (Chapman & Hall, London, U.K) Crossref, Google Scholar