Home LiteratureArticle Details
PMID: 6687857 Published · ppublish English Comparative Study Journal Article

A fast method for arranging DNA sequence fragments.

Computer programs in biomedicine ·Vol. 16 ·No. 1-2 ·1983-00-00 ·Pages 61-9

Osterburg G, Glatting KH, Buchert J, Wolters J

Abstract

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.

MeSH Terms
Base Sequence Computers DNA Software Statistics as Topic
Chemicals
DNA
Authors & Affiliations
4 authors, click to expand affiliations / ORCID
Osterburg G
Glatting K H
Buchert J
Wolters J
Article Info
Journal
Computer programs in biomedicine
Abbr.
Comput Programs Biomed
ISSN
0010-468X
Published
1983-00-00
Pages
61-9
Language
English
Region
Netherlands
NLM ID
0237013
Subset
IM
Analysis Services
Analysis Services

Contact

No. 2 Wenbo Road, Zhangqiu District, Jinan, Shandong

Qilu Normal University · Genelibs Bioinformatics Lab

750 Shunhua Rd, Jinan

2F, Bldg F, University Science Park

Tel: 0531-88819269

WeChat Official Account

Follow our WeChat subscription account for real-time updates and the latest in medical and biological research.


Business Email

E-mail: [email protected]