Complexity of DNA sequencing by hybridization

In the paper, the question of the complexity of the combinatorial part of the DNA sequencing by hybridization, is analyzed. Subproblems of the general problem, depending on the type of error (positive, negative), are distinguished. Since decision versions of the subproblems assuming only one type of error are trivial, complexities of the search counterparts are studied. Both search subproblems are proved to be strongly NP-hard, as well as their uniquely promised versions.

[1]  David Maier,et al.  On Finding Minimal Length Superstrings , 1980, J. Comput. Syst. Sci..

[2]  F. Sanger,et al.  The use of thin acrylamide gels for DNA sequencing , 1978, FEBS letters.

[3]  Malgorzata Sterna,et al.  Selected combinatorial optimization problem arising in molecular biology , 1996 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  A. Lesk.  COMPUTATIONAL MOLECULAR BIOLOGY , 1988, Proceeding of Data For Discovery.

[6]  Michael S. Waterman,et al.  Introduction to Computational Biology: Maps, Sequences and Genomes , 1998 .

[7]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[8]  Alain Hertz,et al.  On some Properties of DNA Graphs , 1999, Discret. Appl. Math..

[9]  João Meidanis,et al.  Introduction to computational molecular biology , 1997 .

[10]  W. Gilbert,et al.  A new method for sequencing DNA. , 1977, Proceedings of the National Academy of Sciences of the United States of America.

[11]  E. Breitenberger,et al.  Angular Correlations between K-Conversion Electrons , 1954, Nature.

[12]  P. Pevzner.  1-Tuple DNA sequencing: computer analysis. , 1989, Journal of biomolecular structure & dynamics.

[13]  Jacek Blazewicz,et al.  DNA Sequencing With Positive and Negative Errors , 1999, J. Comput. Biol..

[14]  Janos Simon,et al.  On the Difference Between One and Many (Preliminary Version) , 1977, ICALP.

[15]  Jacek Blazewicz,et al.  On the recognition of de Bruijn graphs and their induced subgraphs , 2002, Discret. Math..

[16]  Michael S. Waterman,et al.  Introduction to computational biology , 1995 .

[17]  S. P. Fodor,et al.  Light-generated oligonucleotide arrays for rapid DNA sequence analysis. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[18]  Jacek Blazewicz,et al.  Tabu search for DNA sequencing with false negatives and false positives , 2000, Eur. J. Oper. Res..