Switch to
| Predicate | Object |
|---|---|
| rdf:type | |
| lifeskim:mentions | |
| pubmed:issue |
1-2
|
| pubmed:dateCreated |
1983-7-15
|
| pubmed:abstractText |
A method is described which allows efficient arrangement of DNA sequence fragments and, based on this arrangement, reconstruction of a complete DNA sequence. The concepts and algorithms used are based on the mathematical theory of graphs. The amount of human interaction required is considerably reduced compared to existing methods. An experiment with a set of 168 fragments yields a DNA sequence of about 5800 bases almost automatically.
|
| pubmed:language |
eng
|
| pubmed:journal | |
| pubmed:citationSubset |
IM
|
| pubmed:chemical | |
| pubmed:status |
MEDLINE
|
| pubmed:issn |
0010-468X
|
| pubmed:author | |
| pubmed:issnType |
Print
|
| pubmed:volume |
16
|
| pubmed:owner |
NLM
|
| pubmed:authorsComplete |
Y
|
| pubmed:pagination |
61-9
|
| pubmed:dateRevised |
2007-11-15
|
| pubmed:meshHeading | |
| pubmed:articleTitle |
A fast method for arranging DNA sequence fragments.
|
| pubmed:publicationType |
Journal Article,
Comparative Study
|