𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for DNA fragment assembly in MapReduce

✍ Scribed by Baomin Xu; Jin Gao; Chunyan Li

Book ID
119194521
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
295 KB
Volume
426
Category
Article
ISSN
0006-291X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A simple and space-efficient fragment-ch
A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
✍ B. Morgenstern πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 534 KB

In the segment-based approach to sequence alignment. nucleic acid, and protein sequence alignments are constructed from fragments, i.e., from pairs of ungapped segments of the input sequences. Given a set F of candidate fragments and a weighting function w : F + FL:, the score of an alignment is de

[Studies in Computational Intelligence]
[Studies in Computational Intelligence] Parallel Genetic Algorithms Volume 367 || Parallel GAs in Bioinformatics: Assembling DNA Fragments
✍ Luque, Gabriel; Alba, Enrique πŸ“‚ Article πŸ“… 2011 πŸ› Springer Berlin Heidelberg 🌐 German βš– 432 KB

This Book Is The Result Of Several Years Of Research Trying To Better Characterize Parallel Genetic Algorithms (pgas) As A Powerful Tool For Optimization, Search, And Learning. Readers Can Learn How To Solve Complex Tasks By Reducing Their High Computational Times. Dealing With Two Scientific Fields