Optimizing the DNA fragment assembly using metaheuristic-based overlap layout consensus approach
Authors:
- UzmaUZUzma
- Zahid HalimZHZahid Halim
- 1 July 2020
- journal article
- research article
- Published by Elsevier in Applied Soft Computing
- Vol. 92
Abstract
No abstract availableKeywords
Funding Information
- GIK Institute
This publication has 35 references indexed in Scilit:
- Competition between VanUG Repressor and VanRG Activator Leads to Rheostatic Control of vanG Vancomycin Resistance Operon ExpressionPLOS Genetics, 2015
- A memetic particle swarm optimization algorithm for solving the DNA fragment assembly problemNeural Computing and Applications, 2014
- Assemblathon 1: A competitive assessment of de novo short read assembly methodsGenome Research, 2011
- Third Generation DNA Sequencing: Pacific Biosciences' Single Molecule Real Time TechnologyChemistry & Biology, 2010
- DNA fragment assembly using a grid-based genetic algorithmComputers & Operations Research, 2008
- A New Local Search Algorithm for the DNA Fragment Assembly ProblemLecture Notes in Computer Science, 2007
- An Eulerian path approach to DNA fragment assemblyProceedings of the National Academy of Sciences, 2001
- Amino acid substitutions in structurally related proteins a pattern recognition approachJournal of Molecular Biology, 1988
- Comparison of biosequencesAdvances in Applied Mathematics, 1981
- DNA sequencing with chain-terminating inhibitorsProceedings of the National Academy of Sciences of the United States of America, 1977