Meta-Alignment with Crumble and Prune: Partitioning very large alignment problems for performance and parallelization

<p>Abstract</p> <p>Background</p> <p>Continuing research into the global multiple sequence alignment problem has resulted in more sophisticated and principled alignment methods. Unfortunately these new algorithms often require large amounts of time and memory to run, ma...

Full description

Bibliographic Details
Main Authors: Paten Benedict, Roskin Krishna M, Haussler David
Format: Article
Language:English
Published: BMC 2011-05-01
Series:BMC Bioinformatics
Online Access:http://www.biomedcentral.com/1471-2105/12/144
id doaj-cb535b7e31c94531bd6c4a6d19c3f3d4
record_format Article
spelling doaj-cb535b7e31c94531bd6c4a6d19c3f3d42020-11-24T22:19:01ZengBMCBMC Bioinformatics1471-21052011-05-0112114410.1186/1471-2105-12-144Meta-Alignment with Crumble and Prune: Partitioning very large alignment problems for performance and parallelizationPaten BenedictRoskin Krishna MHaussler David<p>Abstract</p> <p>Background</p> <p>Continuing research into the global multiple sequence alignment problem has resulted in more sophisticated and principled alignment methods. Unfortunately these new algorithms often require large amounts of time and memory to run, making it nearly impossible to run these algorithms on large datasets. As a solution, we present two general methods, Crumble and Prune, for breaking a phylogenetic alignment problem into smaller, more tractable sub-problems. We call Crumble and Prune <it>meta-alignment </it>methods because they use existing alignment algorithms and can be used with many current alignment programs. Crumble breaks long alignment problems into shorter sub-problems. Prune divides the phylogenetic tree into a collection of smaller trees to reduce the number of sequences in each alignment problem. These methods are orthogonal: they can be applied together to provide better scaling in terms of sequence length and in sequence depth. Both methods partition the problem such that many of the sub-problems can be solved independently. The results are then combined to form a solution to the full alignment problem.</p> <p>Results</p> <p>Crumble and Prune each provide a significant performance improvement with little loss of accuracy. In some cases, a gain in accuracy was observed. Crumble and Prune were tested on real and simulated data. Furthermore, we have implemented a system called Job-tree that allows hierarchical sub-problems to be solved in parallel on a compute cluster, significantly shortening the run-time.</p> <p>Conclusions</p> <p>These methods enabled us to solve gigabase alignment problems. These methods could enable a new generation of biologically realistic alignment algorithms to be applied to real world, large scale alignment problems.</p> http://www.biomedcentral.com/1471-2105/12/144
collection DOAJ
language English
format Article
sources DOAJ
author Paten Benedict
Roskin Krishna M
Haussler David
spellingShingle Paten Benedict
Roskin Krishna M
Haussler David
Meta-Alignment with Crumble and Prune: Partitioning very large alignment problems for performance and parallelization
BMC Bioinformatics
author_facet Paten Benedict
Roskin Krishna M
Haussler David
author_sort Paten Benedict
title Meta-Alignment with Crumble and Prune: Partitioning very large alignment problems for performance and parallelization
title_short Meta-Alignment with Crumble and Prune: Partitioning very large alignment problems for performance and parallelization
title_full Meta-Alignment with Crumble and Prune: Partitioning very large alignment problems for performance and parallelization
title_fullStr Meta-Alignment with Crumble and Prune: Partitioning very large alignment problems for performance and parallelization
title_full_unstemmed Meta-Alignment with Crumble and Prune: Partitioning very large alignment problems for performance and parallelization
title_sort meta-alignment with crumble and prune: partitioning very large alignment problems for performance and parallelization
publisher BMC
series BMC Bioinformatics
issn 1471-2105
publishDate 2011-05-01
description <p>Abstract</p> <p>Background</p> <p>Continuing research into the global multiple sequence alignment problem has resulted in more sophisticated and principled alignment methods. Unfortunately these new algorithms often require large amounts of time and memory to run, making it nearly impossible to run these algorithms on large datasets. As a solution, we present two general methods, Crumble and Prune, for breaking a phylogenetic alignment problem into smaller, more tractable sub-problems. We call Crumble and Prune <it>meta-alignment </it>methods because they use existing alignment algorithms and can be used with many current alignment programs. Crumble breaks long alignment problems into shorter sub-problems. Prune divides the phylogenetic tree into a collection of smaller trees to reduce the number of sequences in each alignment problem. These methods are orthogonal: they can be applied together to provide better scaling in terms of sequence length and in sequence depth. Both methods partition the problem such that many of the sub-problems can be solved independently. The results are then combined to form a solution to the full alignment problem.</p> <p>Results</p> <p>Crumble and Prune each provide a significant performance improvement with little loss of accuracy. In some cases, a gain in accuracy was observed. Crumble and Prune were tested on real and simulated data. Furthermore, we have implemented a system called Job-tree that allows hierarchical sub-problems to be solved in parallel on a compute cluster, significantly shortening the run-time.</p> <p>Conclusions</p> <p>These methods enabled us to solve gigabase alignment problems. These methods could enable a new generation of biologically realistic alignment algorithms to be applied to real world, large scale alignment problems.</p>
url http://www.biomedcentral.com/1471-2105/12/144
work_keys_str_mv AT patenbenedict metaalignmentwithcrumbleandprunepartitioningverylargealignmentproblemsforperformanceandparallelization
AT roskinkrishnam metaalignmentwithcrumbleandprunepartitioningverylargealignmentproblemsforperformanceandparallelization
AT hausslerdavid metaalignmentwithcrumbleandprunepartitioningverylargealignmentproblemsforperformanceandparallelization
_version_ 1725780575722143744