DocumentCode :
2454667
Title :
Open combinatorial problems in computational molecular biology
Author :
Pevzner, Pavel A. ; Waterman, Micheal S.
Author_Institution :
Dept. of Electr. & Comput. Eng., Pennsylvania State Univ., University Park, PA, USA
fYear :
1995
fDate :
4-6 Jan 1995
Firstpage :
158
Lastpage :
173
Abstract :
In the last few years theoretical computer scientists have found new challenges in computational molecular biology. We discuss recent advances and present some open combinatorial problems in different areas of computational molecular biology such as genome rearrangements, DNA physical mapping, DNA sequencing and sequence comparison
Keywords :
DNA; biology computing; combinatorial mathematics; computational complexity; molecular biophysics; sorting; string matching; DNA physical mapping; DNA sequencing; computational molecular biology; genome rearrangements; open combinatorial problems; sequence comparison; Application software; Bioinformatics; Biology computing; Computational biology; Computer science; DNA computing; Evolution (biology); Genomics; Physics computing; Sequences;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Theory of Computing and Systems, 1995. Proceedings., Third Israel Symposium on the
Conference_Location :
Tel Aviv
Print_ISBN :
0-8186-6915-2
Type :
conf
DOI :
10.1109/ISTCS.1995.377035
Filename :
377035
Link To Document :
بازگشت