1999
DOI: 10.1090/dimacs/048/03
|View full text |Cite
|
Sign up to set email alerts
|

The efficiency of sequence-specific separation of DNA mixtures for biological computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

1999
1999
2014
2014

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…Despite optimism about future techniques, current techniques available for DNA-based combinatorial search are too slow and/or inaccurate to solve a problem of even moderate size. [10] …”
Section: Dna-based Methods For Combinatorial Searchmentioning
confidence: 99%
“…Despite optimism about future techniques, current techniques available for DNA-based combinatorial search are too slow and/or inaccurate to solve a problem of even moderate size. [10] …”
Section: Dna-based Methods For Combinatorial Searchmentioning
confidence: 99%
“…Besides, all of the sequencing methods require DNA extraction and purification. Khodor and Gifford [13] had pointed out that the upper bound on the efficiency of separation of DNA mixtures using magnetic beads is less than 1% without homologous probes and targets. Thus currently it is almost impossible to precisely sequence such a small amount of unknown mixed, sequence-specific DNA.…”
Section: Preliminariesmentioning
confidence: 99%
“…Previously, we have also used competitive hybridization reactions to implement a molecular pattern classifier (Lim et al, 2010). However, it required affinity bead separation to remove unbound probes before the final output detection, which was the main source of error and brought about a significant increase of overall computation time (Khodor and Gifford, 1997). Using molecular beacons helps us to overcome these drawbacks.…”
Section: Weighted Detection and Analysis Of Target Nucleic Acidsmentioning
confidence: 99%