Skip Navigation


Bioinformatics Advance Access originally published online on January 5, 2006
Bioinformatics 2006 22(5):618-620; doi:10.1093/bioinformatics/btk020
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Supplementary Data
Right arrowOA All Versions of this Article:
22/5/618    most recent
btk020v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Google Scholar
Right arrow Articles by Smith, A.
Right arrow Articles by Brenner, S. E.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Smith, A.
Right arrow Articles by Brenner, S. E.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org
The online version of this article has been published under an open access model. Users are entitled to use, reproduce, disseminate, or display the open access version of this article for non-commercial purposes provided that: the original authorship is properly and fully attributed; the Journal and Oxford University Press are attributed as the original place of publication with the correct citation details given; if an article is subsequently reproduced or disseminated not in its entirety but only in part or as a derivative work this must be clearly indicated. For commercial re-use, please contact journals.permissions@oxfordjournals.org

ANDY: a general, fault-tolerant tool for database searching on computer clusters

Andrew Smith 1,2,3,4, John-Marc Chandonia 2 and Steven E. Brenner 1,2,*

1Department of Plant and Microbial Biology 461A Koshland Hall University of California Berkeley, CA 94720-3102, USA
2Berkeley Structural Genomics Center, Physical Biosciences Division, Lawrence Berkeley National Laboratory Berkeley, CA 94720, USA
3Department of Molecular Biophysics and Biochemistry, Yale University New Haven, CT 06520, USA
4Department of Computer Science, Yale University New Haven, CT 06520, USA

*To whom correspondence should be addressed.

Summary: ANDY (seArch coordination aND analYsis) is a set of Perl programs and modules for distributing large biological database searches, and in general any sequence of commands, across the nodes of a Linux computer cluster. ANDY is compatible with several commonly used distributed resource management (DRM) systems, and it can be easily extended to new DRMs. A distinctive feature of ANDY is the choice of either dedicated or fair-use operation: ANDY is almost as efficient as single-purpose tools that require a dedicated cluster, but it runs on a general-purpose cluster along with any other jobs scheduled by a DRM. Other features include communication through named pipes for performance, flexible customizable routines for error-checking and summarizing results, and multiple fault-tolerance mechanisms.

Availability: ANDY is freely available and can be obtained from http://compbio.berkeley.edu/proj/andy

Contact: brenner{at}compbio.berkeley.edu

Supplementary information: Supplemental data, figures, and a more detailed overview of the software are found at http://compbio.berkeley.edu/proj/andy


Received on August 22, 2005; revised on November 29, 2005; accepted on December 20, 2005

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.