Modified Classical Graph Algorithms for the DNA Fragment Assembly Problem
Modified Classical Graph Algorithms for the DNA Fragment Assembly Problem
About this item
Full title
Author / Creator
Publisher
Basel: MDPI AG
Journal title
Language
English
Formats
Publication information
Publisher
Basel: MDPI AG
Subjects
More information
Scope and Contents
Contents
DNA fragment assembly represents an important challenge to the development of efficient and practical algorithms due to the large number of elements to be assembled. In this study, we present some graph theoretical linear time algorithms to solve the problem. To achieve linear time complexity, a heap with constant time operations was developed, for...
Alternative Titles
Full title
Modified Classical Graph Algorithms for the DNA Fragment Assembly Problem
Authors, Artists and Contributors
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_2fb3977fa46242bda223fbbd45e1bae3
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_2fb3977fa46242bda223fbbd45e1bae3
Other Identifiers
ISSN
1999-4893
E-ISSN
1999-4893
DOI
10.3390/a8030754
