PTPan - overcoming memory limitations in oligonucleotide string matching for primer/probe design

MOTIVATION Nucleic acid diagnostics has high demands for non-heuristic exact and approximate oligonucleotide string matching concerning in silico primer/probe design in huge nucleic acid sequence collections. Unfortunately, public sequence repositories grow much faster than computer hardware performance and main memory capacity do. This growth imposes severe problems on existing oligonucleotide primer/probe design applications necessitating new approaches based on space-efficient indexing structures. RESULTS We developed PTPan (spoken Peter Pan, 'PT' is for Position Tree, the earlier name of suffix trees), a space-efficient indexing structure for approximate oligonucleotide string matching in nucleic acid sequence data. Based on suffix trees, it combines partitioning, truncation and a new suffix tree stream compression to deal with large amounts of aligned and unaligned data. PTPan operates efficiently in main memory and on secondary storage, balancing between memory consumption and runtime during construction and application. Based on PTPan, applications supporting similarity search and primer/probe design have been implemented, namely FindFamily, ProbeMatch and ProbeDesign. All three use a weighted Levenshtein distance metric for approximative queries to find and rate matches with indels as well as substitutions. We integrated PTPan in the worldwide used software package ARB to demonstrate usability and performance. Comparing PTPan and the original ARB index for the very large ssu-rRNA database SILVA, we recognized a shorter construction time, extended functionality and dramatically reduced memory requirements at the price of expanded, but very reasonable query times. PTPan enables indexing of huge nucleic acid sequence collections at reasonable application response times. Not being limited by main memory, PTPan constitutes a major advancement regarding rapid oligonucleotide string matching in primer/probe design now and in the future facing the enormous growth of molecular sequence data. AVAILABILITY Supplementary Material, PTPan stand-alone library and ARB-PTPan binary on http://ptpan.lrr.in.tum.de/. CONTACT meierh@in.tum.de SUPPLEMENTARY INFORMATION Supplementary data are available at Bioinformatics online.

[1]  Alex Thomo,et al.  A survey of practical algorithms for suffix tree construction in external memory , 2010, Softw. Pract. Exp..

[2]  Frank Oliver Glöckner,et al.  Graphical representation of ribosomal RNA probe accessibility data using ARB software package , 2005, BMC Bioinformatics.

[3]  K. Schleifer,et al.  ARB: a software environment for sequence data. , 2004, Nucleic acids research.

[4]  Susan M. Huse,et al.  A Method for Studying Protistan Diversity Using Massively Parallel Sequencing of V9 Hypervariable Regions of Small-Subunit Ribosomal RNA Genes , 2009, PloS one.

[5]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[6]  Eoin L. Brodie,et al.  Greengenes, a Chimera-Checked 16S rRNA Gene Database and Workbench Compatible with ARB , 2006, Applied and Environmental Microbiology.

[7]  R. Durbin,et al.  Sequence analysis Fast and accurate short read alignment with Burrows – Wheeler transform , 2009 .

[8]  R. Amann,et al.  Single-cell identification in microbial communities by improved fluorescence in situ hybridization techniques , 2008, Nature Reviews Microbiology.

[9]  Alistair Moffat,et al.  Reducing Space Requirements for Disk Resident Suffix Arrays , 2009, DASFAA.

[10]  Marcel H. Schulz,et al.  The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences , 2008, Int. J. Bioinform. Res. Appl..

[11]  Adam M. Phillippy,et al.  Comprehensive DNA Signature Discovery and Validation , 2007, PLoS Comput. Biol..

[12]  Wojciech Rytter,et al.  Extracting Powers and Periods in a String from Its Runs Structure , 2010, SPIRE.

[13]  S. Salzberg,et al.  Versatile and open software for comparing large genomes , 2004, Genome Biology.

[14]  Harald Meier,et al.  46. ARB: A Software Environment for Sequence Data , 2011 .

[15]  Marina Barsky,et al.  Suffix trees for very large inputs , 2010 .

[16]  Enno Ohlebusch,et al.  Replacing suffix trees with enhanced suffix arrays , 2004, J. Discrete Algorithms.

[17]  D. Noguera,et al.  Systematic evaluation of single mismatch stability predictors for fluorescence in situ hybridization. , 2008, Environmental microbiology.

[18]  W. Ludwig,et al.  SILVA: a comprehensive online resource for quality checked and aligned ribosomal RNA sequence data compatible with ARB , 2007, Nucleic acids research.

[19]  Jae Jun Song,et al.  Analysis of the Fine-Scale Population Structure of “Candidatus Accumulibacter phosphatis” in Enhanced Biological Phosphorus Removal Sludge, Using Fluorescence In Situ Hybridization and Flow Cytometric Sorting , 2010, Applied and Environmental Microbiology.

[20]  Richard Durbin,et al.  Sequence analysis Fast and accurate short read alignment with Burrows – Wheeler transform , 2009 .

[21]  Hubert Rehrauer,et al.  16S rRNA gene-based phylogenetic microarray for simultaneous identification of members of the genus Burkholderia. , 2009, Environmental microbiology.

[22]  Robert J. Seviour,et al.  Non-target sites with single nucleotide insertions or deletions are frequently found in 16S rRNA sequences and can lead to false positives in fluorescence in situ hybridization (FISH). , 2011, Environmental microbiology.

[23]  Christian Grothoff,et al.  Comprehensive and relaxed search for oligonucleotide signatures in hierarchically clustered sequence datasets , 2011, Bioinform..

[24]  Gonzalo Navarro,et al.  Approximate String Matching with Compressed Indexes , 2009, Algorithms.

[25]  Thomas Rattei,et al.  probeCheck – a central resource for evaluating oligonucleotide probe coverage and specificity , 2008, Environmental microbiology.