DocumentCode :
3396902
Title :
Reconstructing strings from substrings in rounds
Author :
Margaritis, Dimitris ; Skiena, Steven S.
Author_Institution :
Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
fYear :
1995
fDate :
23-25 Oct 1995
Firstpage :
613
Lastpage :
620
Abstract :
We establish a variety of combinatorial bounds on the tradeoffs inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results lead us to propose a new approach to sequencing by hybridization (SBH), which uses interaction to dramatically reduce the number of oligonucleotides used for de novo sequencing of large DNA fragments, while preserving the parallelism which is the primary advantage of SBH
Keywords :
DNA; biology computing; pattern matching; string matching; SBH; combinatorial bounds; de novo sequencing; interaction; large DNA fragments; oligonucleotides; parallelism; rounds; sequencing by hybridization; string reconstruction; substring queries; substrings; Chip scale packaging; Computer science; Costs; DNA; Detectors; Sequences; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1995. Proceedings., 36th Annual Symposium on
Conference_Location :
Milwaukee, WI
ISSN :
0272-5428
Print_ISBN :
0-8186-7183-1
Type :
conf
DOI :
10.1109/SFCS.1995.492591
Filename :
492591
Link To Document :
بازگشت