PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 8, 2008Bioinformatics205 citationsOpen Access

PatMaN: rapid alignment of short sequences to large databases

View Full Paper
KPKay PrüferUSUdo StenzelMDMichael Dannemann

Key Points

Key points are not available for this paper at this time.

Abstract

UNLABELLED: 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. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Prüfer et al. (2008) studied this question.

synapsesocial.com/papers/6a0cc7889d761985b14a487chttps://doi.org/10.1093/bioinformatics/btn223
Ask AI
Helpful
Bookmark
Share
View Full Paper