A new algorithm for combinatorial dna library assembly

Jonathan Blakes, Ofir Raz, Natalio Krasnogor, Ehud Shapiro

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We describe a novel greedy algorithm for computing near-optimal DNA assembly graphs and show empirically that it runs in linear time, enabling almost instantaneous planning of DNA library sizes exceeding the capacity of today’s biochemical assembly methods. We compare assembly graph quality and algorithmic performance to the results obtained in [1], demonstrating that they are significantly faster to obtain and equivalent to the best results for DNA library assembly with intermediate reuse found in the literature.
Original languageEnglish
Title of host publication5th International Workshop on Bio-Design Automation (IWBDA 2013)
StatePublished - 2013
Event5th International Workshop on Bio-Design Automation - London, United Kingdom
Duration: 12 Jul 201313 Jul 2013
https://www.iwbdaconf.org/2013/

Conference

Conference5th International Workshop on Bio-Design Automation
Abbreviated titleIWBDA
Country/TerritoryUnited Kingdom
CityLondon
Period12/07/1313/07/13
Internet address

Fingerprint

Dive into the research topics of 'A new algorithm for combinatorial dna library assembly'. Together they form a unique fingerprint.

Cite this