Tabu search for DNA sequencing with false negatives and false positives

European Journal of Operational Research

Volumn 125, Issue 2, 2000, Pages 257-265

  Blazewicz, J ^a,b   Formanowicz, P ^a,b   Kasprzak, M ^a,b   Markiewicz, W T ^b   Weglarz J ^a,b  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b INSTITUTE OF BIOORGANIC CHEMISTRY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DNA; ERROR ANALYSIS; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; POLYNOMIALS; STATISTICAL METHODS;

INTEGER LINEAR PROGRAMMING; TABU SEARCH;

OPERATIONS RESEARCH;

EID: 0033705735     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00456-7     Document Type: Article

References (19)

1. Apostolico, A., Giancarlo, R., 1997. Sequence alignment in molecular biology. In: Farach, M., Roberts, F., Waterman M. (Eds.), Mathematical Support for Molecular Biology. Am. Math. Soc. DIMACS series.
2. Bains W. Hybridization methods for DNA sequencing. Genomics. 10:1991;294-301.
3. Bains W., Smith G.C. A novel method for nucleic acid sequence determination. Journal of Theoretical Biology. 135:1988;303-307.
4. Blazewicz J., Formanowicz P., Kasprzak M., Markiewicz W.T., Wȩglarz J. DNA sequencing with positive and negative errors. Journal of Computational Biology. 6:1999;113-123.
5. Blazewicz J., Kaczmarek J., Kasprzak M., Markiewicz W.T., Wȩglarz J. Sequential and parallel algorithms for DNA sequencing. Computer Applications in the Biosciences. 13:1997;151-158.
6. Blazewicz, J., Kasprzak, M., 1999. Complexity of DNA sequencing with errors. Report RA-001/99, Poznań Supercomputing and Networking Center, Poznań, Poland.
7. Blazewicz J., Kasprzak M., Sterna M., Wȩglarz J. Selected combinatorial optimization problems arising in molecular biology. Ricerca Operativa. 80:1996;35-63.
8. Caviani Pease, A., Solas, D., Sullivan, E.J., Cronin, M.T., Holmes, C.P., Fodor, S.P.A., 1994. Light-generated oligonucleotide arrays for rapid DNA sequence analysis. In: Proceedings of the National Academy of Sciences, USA, vol. 91, pp. 5022-5026.
9. Dramanac R., Labat I., Crkvenjakov R. An algorithm for the DNA sequence generation from. k -tuple word contents of the minimal number of random fragments Journal of Biomolecular Structure and Dynamics. 8:1991;1085-1102.
10. Glover F., Laguna M. Tabu Search. 1997;Kluwer Academic Publishers, Boston.
11. Guenoche A. Can we recover a sequence, just knowing all its subsequences of given length? Computer Applications in the Biosciences. 8:1992;569-574.
12. Khrapko K.R., Lysov Y.P., Khorlin A.A., Shik V.V., Florentiev V.L., Mirzabekov A.D. An oligonucleotide approach to DNA sequencing. FEBS Letters. 256:1989;118-122.
13. Laporte G., Martello S. The selective travelling salesman problem. Discrete Applied Mathematics. 26:1990;193-207.
14. Lipshutz R.J. Likelihood DNA sequencing by hybridization. Journal of Biomolecular Structure and Dynamics. 11:1993;637-653.
15. Pevzner P.A. l-Tuple DNA sequencing: Computer analysis. Journal of Biomolecular Structure and Dynamics. 7:1989;63-73.
16. Setubal J., Meidanis J. Introduction to Computational Molecular Biology. 1997;PWS, Boston.
17. Vingron, M., Lenhof, H.P., Mutzel, P., 1997. Computational molecular biology. In: Dell'Amico, M., Maffioli, F., Martello, S. (Eds.), Annotated Bibliographies in Combinatorial Optimization. Wiley, Chichester.
18. Waterman M.S. Introduction to Computational Biology, Maps Sequences and Genomes. 1995;Chapman & Hall, London.
19. Watson J.D., Crick F.H.C. A structure for deoxyribose nucleic acid. Nature. 173:1953;737-738.