Skip Navigation


Bioinformatics Advance Access originally published online on May 8, 2008
Bioinformatics 2008 24(13):1530-1531; doi:10.1093/bioinformatics/btn223
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:
24/13/1530    most recent
btn223v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 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 Prüfer, K.
Right arrow Articles by Kelso, J.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Prüfer, K.
Right arrow Articles by Kelso, J.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

PatMaN: rapid alignment of short sequences to large databases

Kay Prüfer *,{dagger}, Udo Stenzel {dagger}, Michael Dannemann , Richard E. Green , Michael Lachmann and Janet Kelso

Max-Planck Institute for Evolutionary Anthropology, Deutscher Platz 6, 04103 Leipzig, Germany

*To whom correspondence should be addressed.


  Abstract

Summary: We present a tool suited for searching for many short nucleotide sequences in large databases, allowing for a predefined number of gaps and mismatches. The commandline-driven program implements a non-deterministic automata matching algorithm on a keyword tree of the search strings. Both queries with and without ambiguity codes can be searched. Search time is short for perfect matches, and retrieval time rises exponentially with the number of edits allowed.

Availability: The C++ source code for PatMaN is distributed under the GNU General Public License and has been tested on the GNU/Linux operating system. It is available from http://bioinf.eva.mpg.de/patman.

Contact: pruefer{at}eva.mpg.de

Supplementary information: Supplementary data are available at Bioinformatics online.

Associate Editor: Limsoon Wong

{dagger}The authors wish it to be known that, in their opinion, the first two authors should be regarded as joint First Authors.

Received on March 21, 2008; revised on April 24, 2008; accepted on May 3, 2008

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


This article has been cited by other articles:


Home page
 BioinformaticsHome page
D. Campagna, A. Albiero, A. Bilardi, E. Caniato, C. Forcato, S. Manavski, N. Vitulo, and G. Valle
PASS: a program to align short sequences
Bioinformatics, April 1, 2009; 25(7): 967 - 968.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
S. Moxon, F. Schwach, T. Dalmay, D. MacLean, D. J. Studholme, and V. Moulton
A toolkit for analysing large-scale plant small RNA datasets
Bioinformatics, October 1, 2008; 24(19): 2252 - 2253.
[Abstract] [Full Text] [PDF]


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.