- Research article
- Open Access
Searching for evolutionary distant RNA homologs within genomic sequences using partition function posterior probabilities
© Roshan et al; licensee BioMed Central Ltd. 2008
- Received: 31 July 2007
- Accepted: 28 January 2008
- Published: 28 January 2008
Identification of RNA homologs within genomic stretches is difficult when pairwise sequence identity is low or unalignable flanking residues are present. In both cases structure-sequence or profile/family-sequence alignment programs become difficult to apply because of unreliable RNA structures or family alignments. As such, local sequence-sequence alignment programs are frequently used instead. We have recently demonstrated that maximal expected accuracy alignments using partition function match probabilities (implemented in Probalign) are significantly better than contemporary methods on heterogeneous length protein sequence datasets, thus suggesting an affinity for local alignment.
We create a pairwise RNA-genome alignment benchmark from RFAM families with average pairwise sequence identity up to 60%. Each dataset contains a query RNA aligned to a target RNA (of the same family) embedded in a genomic sequence at least 5K nucleotides long. To simulate common conditions when exact ends of an ncRNA are unknown, each query RNA has 5' and 3' genomic flanks of size 50, 100, and 150 nucleotides. We subsequently compare the error of the Probalign program (adjusted for local alignment) to the commonly used local alignment programs HMMER, SSEARCH, and BLAST, and the popular ClustalW program with zero end-gap penalties. Parameters were optimized for each program on a small subset of the benchmark. Probalign has overall highest accuracies on the full benchmark. It leads by 10% accuracy over SSEARCH (the next best method) on 5 out of 22 families. On datasets restricted to maximum of 30% sequence identity, Probalign's overall median error is 71.2% vs. 83.4% for SSEARCH (P-value < 0.05). Furthermore, on these datasets Probalign leads SSEARCH by at least 10% on five families; SSEARCH leads Probalign by the same margin on two of the fourteen families. We also demonstrate that the Probalign mean posterior probability, compared to the normalized SSEARCH Z-score, is a better discriminator of alignment quality. All datasets and software are available online.
We demonstrate, for the first time, that partition function match probabilities used for expected accuracy alignment, as done in Probalign, provide statistically significant improvement over current approaches for identifying distantly related RNA sequences in larger genomic segments.
- Partition Function
- Pairwise Alignment
- Alignment Quality
- Entire Query
- Genomic Flank
The importance of RNA within cellular machinery and regulation is well established [1, 2]. Consequently, a proper understanding of RNA structure and function is vital to a more complete understanding of cellular processes. It is conjectured that the human genome contains several thousand yet undiscovered ncRNAs that play critical roles throughout the cell. Profile-sequence and structure-sequence methods, such as HMMER  and INFERNAL , are commonly used to identify RNA homologs within much larger genomic segments. However, the requirement of a reliable family alignment and/or structure diminishes the utility of these approaches. This can happen especially when searching for evolutionary distant homologs or the query RNA sequence is surrounded by unalignable flanking nucleotides. In fact, homologous sequences below 60% pairwise identity are generally too difficult for current methods . Simple pairwise alignment approaches are commonly used when sufficient familial data is not available. The SSEARCH program , a popular implementation of the Smith-Waterman algorithm, is frequently used for finding RNA homologs in genomic sequences. Moreover, it is a commonly used benchmark that new homology search methods are compared against [7–10]. The NCBI BLAST program , which is also a local alignment algorithm, is faster than SSEARCH but much less sensitive.
SSEARCH and BLAST both search for optimal local alignments, with BLAST sacrificing sensitivity for speed. Conversely, the maximal expected accuracy approach is based on suboptimal alignments. Here, sequences are aligned using posterior/match probabilities within pairwise alignments. These probabilities can be computed using partition function dynamic programming matrices, introduced by Miyazawa  and later studied by others [13, 14], or pairwise HMMs as done in ProbconsRNA . Partition function posterior probabilities are analogous to nucleotide-nucleotide frequency counts estimated from an ensemble of suboptimal alignments (see ref.  for more details). We recently implemented the partition function approach within the program Probalign , which outperforms other leading multiple aligners (Probcons , MAFFT , and MUSCLE [17, 18]) on three different protein alignment benchmarks (BAliBASE , HOMSTRAD , and OXBENCH ).
While Probalign was designed for global alignment, its performance on datasets of heterogeneous length  suggests an affinity for local alignment. Here, we implement a slightly modified Probalign version attuned to local alignment search. We have studied its performance on the pairwise RNA-genome homology search problem for divergent sequences and when the query is flanked by genomic nucleotides. We compare it to SSEARCH, BLAST, ClustalW , and HMMER (with single sequence profiles). We include ClustalW (with zero end gaps) due its wide usage in solving different alignment problems. In addition, ClustalW serves as an analogous example of a global multiple alignment method applied to this problem for us to compare Probalign to. We have carefully constructed a benchmark of divergent RNA-genomic alignments using real DNA and RNA sequences from the EMBL  and RFAM  databases, respectively. In order to maintain a reasonable level of difficulty and tractability for the experiments, each genomic sequence in our benchmark is at least 5K and at most 16K nucleotides in length. For added difficulty and to simulate practical conditions where exact 5' and 3' ends of ncRNA are unknown, we add real genomic flanks of size 50, 100, and 150 nucleotides to the query RNA of each dataset.
We specifically omit INFERNAL from this investigation for several reasons. First, and most importantly, (as discussed above) the utility of profile-sequence and structure-sequence alignment methods is limited by experimental data. At large evolutionary distances and with unalignable genomic flanks surrounding the query, which is the particular focus of this study, obtaining reliable RNA family alignments is considerably difficult. Second, the cmsearch program of the INFERNAL suite is, in part, used for constructing RFAM families from which we construct our benchmark. Additional sequences found using INFERNAL were added to the RFAM seed alignments . Finally, we use cmsearch in intermediary steps of producing the benchmark (explained in the Methods Section below). In light of all these facts, it would be inappropriate to include INFERNAL in our experiments. We include HMMER in our experiments using both global-local and local-local alignment models (i.e. -g and -f, -s options); however, we construct the HMMER model using single sequence queries (without flanks) from the benchmark. In this way we have a reasonable comparison to the other sequence-based programs in our test set. In the remainder of the paper we refer to this setting of the program as just HMMER.
We find Probalign to have overall highest accuracies on the full benchmark. It leads by 10% accuracy over SSEARCH (the next best method) on 5 out of 22 families. On datasets restricted to maximum of 30% sequence identity, Probalign's overall median error is 71.2% vs. 83.4% for SSEARCH (the next best method). This difference has Friedman rank test P-value less than 0.05. Furthermore, on these datasets, Probalign leads SSEARCH by at least 10% on five families whereas SSEARCH leads Probalign by the same margin on two families out of a total of fourteen. We also demonstrate that the Probalign mean posterior probability, compared to the normalized SSEARCH Z-score, is a better discriminator of alignment quality. The Probalign mean posterior probability has Receiver Operator Characteristic (ROC) area under curve of 0.834 compared to 0.806 of the normalized SSEARCH Z-score.
Note that the performance of RNA homology search programs was examined previously by Freyhult et. al. . Their benchmark and goals, however, were considerably different than ours. They studied RNA homology searches within RFAM RNA sequence databases without genomic flanks, and considered only a single genomic search example. Here, we are specifically interested in performance of programs for finding low sequence similarity RNA homologs (with flanks) in long genomic sequences.
We computed the mean error of each method within each RNA family by averaging over all pairwise alignment scores belonging to that family. We then computed the overall error of each method as the average score across all families.
Full benchmark with query flanks
Mean and median percent error for all methods on the full benchmark (13,716 datasets) including query RNAs with flanks of size 50, 100, and 150.
Mean and median error
35.3 | 30.7
38.7 | 33.2
41.0 | 34.0
47.6 | 50.3
Datasets with pairwise sequence identity at most 30%
66.5* | 71.2*
73.0 | 83.4
75.9 | 85.3
82.9 | 85.0
Mean Probalign and SSEARCH percent error shown for each RFAM family in the full benchmark and for datasets with maximum pairwise sequence identity of 30%.
Complete benchmark dataset
Subset with pairwise identity up to 30%
Column two of the table lists the Probalign and SSEARCH error on datasets restricted to maximum 30% sequence identity. There are fourteen families containing datasets that satisfy this criterion. Out of the total fourteen, Probalign leads by at least 10% on five families whereas SSEARCH leads Probalign by at least same margin on two families.
Mean percent error as a function of query RNA flank size.
Query RNA flank size
Benchmark without query flanks
Mean and median percent error for all methods on the benchmark without query RNA flanks (3,429 datasets).
Mean and median error
30.8 | 30.4
31.4 | 22.1
32.0 | 20.9
37.9 | 38.5
44.9 | 44.7
Datasets with pairwise sequence identity at most 30% (14)
62.4 | 59.5
70.8 | 94.5
78.4 | 100.0
74.5 | 97.5
96.7 | 100.0
Discriminating true from false alignments
In order for the evaluated methods to be of practical utility in ncRNA searches, alignments found when there is no target-query match (a common real-world scenario), should be of poorer quality than the alignments above where target-query matches were always present. To assess the discriminative ability of Probalign and SSEARCH (the two best scoring methods above), we generated a false dataset of query-target pairs where the query and target were randomly selected from distinct RFAM families (see Sub-Section Alignment quality measures under the Methods Section). The size of the false dataset is 13,716, exactly the same as the real dataset used above. Concatenating the real and false datasets results in 27,432 target-query pairs that were subsequently aligned using both methods. An alignment on a false positive dataset or an alignment with 100% error on the benchmark is classified as a false positive. An alignment on the benchmark with less than 100% error is classified as a true positive. A good discriminator would have a high value on alignments with high accuracy and low value on alignments with 100% error on benchmark datasets or on the false positive dataset. In this case we are interested in the quality of the Probalign mean column posterior probability and the SSEARCH normalized Z-score as alignment discriminators.
Computational running time and memory requirements
The current Probalign implementation is not as sophisticated as its SSEARCH counterpart, and therefore is much slower in comparison to the SSEARCH time. However, in practice it never takes more than a few seconds on any of our datasets. The average Probalign running time on the benchmark is 5.4 seconds compared to 0.04 seconds of SSEARCH, 0.5 seconds of ClustalW, 0.003 seconds of BLAST, and 0.14 seconds of HMMER (hmmsearch). These running times were computed on 2.4 GHz AMD Opteron 64 bit machines.
A standard technique for discovering new RNAs, in the absence of queries, is to align genomic fragments and search the alignment for significant structural conservation. QRNA  RNAz  and MSARI  are some well-known programs frequently used for this purpose. Their performance, of course depends upon the underlying sequence alignments. Our work here suggests that Probalign genomic alignments may align hidden (but related) RNA better than standard methods when given two genomic sequences. As a result it could produce more informative alignments for RNA detection programs such as the ones listed above.
Several improvements are currently underway to Probalign. A full Probalign-local implementation would include a Smith-Waterman implemenation of posterior probability local alignment, as done in the Proda  program. We expect such an implementation to produce better mean posterior probabilities estimates of the alignment quality since it would exclude unrelated genomic flanks.
In big-O notation Probalign's worst-case running time and memory requirements for pairwise alignment is O(mn) where m and n are the lengths of the input sequences. Probalign's memory requirements can be improved to O(mn1/2) with a 1.5 factor slowdown using memory reduction techniques used for HMM-based alignment programs . This is part of planned future work.
Finally, it remains to be seen if Probalign partition function posterior probabilities demonstrate the same level of improvement seen her for the profile-sequence alignment and profile-profile alignment problems. The utility of profiles, however, is limited when unknown and unalignable genomic flanks are present or the family alignment is not rich or accurate enough. In that case, our current Probalign implementation offers a viable solution as demonstrated.
This report represents the first examination of the Probalign alignment algorithm to search for RNA homologs within much larger genomic segments using partition function posterior probabilities. We show that the method does much better than the widely used SSEARCH and BLAST programs. Furthermore, the Probalign mean posterior probability (which has previously been discussed as a possible metric to assess alignment quality, but never studied carefully) has been shown to be a better indicator of alignment quality than the standard SSEARCH Z-score.
We began by extracting all 26 RFAM  seed alignments with known published RNA secondary structures and average pairwise sequence identity of at most 60%. During the benchmark construction process four families fail to meet length and uniqueness criteria (see below); this subsequently leaves us with 22 families in the end. At the time of writing of this paper RFAM version 7.0 was the most recent release. We measure sequence identity in regions of known secondary structure only, which are generally more reliably aligned than the rest. The 60% threshold has previously been identified as a cutoff for hard RNA alignment cases  and so we focus specifically on this region. We use the following three main steps to construct our benchmark from the initial 26 families.
1. Pairwise RNA-RNA alignments
For each of the initial 26 RFAM seed multiple alignments, we randomly select a maximum of 350 pairwise alignments. In families where there are less than 350 total pairs, we consider them all.
2. Construction of genomic flanks
Every RNA sequence in RFAM seed is cross-linked to a genomic sequence in EMBL . For each pairwise alignment produced above, we randomly select one of the RNA sequences and attach real genomic flanks from EMBL (version r88) to each end of the RNA. Each genomic flank is truncated to 7500 base pairs on either end. Since the largest RNA sequence is at most 1000 nucleotides long, the maximum size of each genomic sequence is 16,000. This gives us RNA genome alignments where the RNA sequence can be considered as a query and the aligned homologous RNA is the target "hidden" in the genome. In order to make our dataset challenging enough, we exclude datasets where the genomic sequence is shorter than 5000 nucleotides.
3. Alignment uniqueness
The attached genomic flanks may contain additional related RNAs of the same family as the query and the target (to which the flanks were attached). This means that two different correct alignments are possible. To keep things simple, we exclude such datasets and ensure that each query-target alignment is unique. For each dataset we built a profile from the RFAM family alignment annotated with consensus secondary structure using the cmbuild program of the INFERNAL suite. We then ran the cmsearch program of the INFERNAL suite on the genomic sequence of the dataset and excluded it entirely from the benchmark if more than one hit above a bit score of 30 was reported.
The pruning process yielded a total of 3,429 pairwise alignments distributed (unequally) among 22 RNA families. As mentioned earlier, all the datasets in four families failed to meet our length and uniqueness criteria just described. This subsequently leaves us with 22 families in the end. The 22 families and their characteristics can be found in Additional file 1.
Adding genomic flanks to query RNA
To simulate practical conditions where the exact 5' and 3' ends of ncRNAs are unknown, we took each dataset in our benchmark and produced three similar versions. However, in each of the three versions we added real 5' and 3' genomic flanks of size 50, 100, and 150 nucleotides to the query RNA of each dataset. By cross-referencing each RNA sequence to the original genomic version in EMBL we were able to obtain proper real genomic flanks and hence did not need to simulate artificial ones. Subsequently, the size of our benchmark increased four-fold from 3,429 to 13,716. We remove gaps from each alignment and use the flanked query and target genomic sequences as input to each program.
The full benchmark is available online . Also available at the website are the RFAM family alignments from which the benchmark was created, training datasets (see below), and false positive datasets used for discrimination tests (described below).
Alignment programs and parameters
We used a subset of the benchmark with query RNA flanks of size 100 nucleotides for training the program parameters. For each of the 22 divergent families we selected 25 random datasets. If the family contained a total of less than 25 pairwise alignments we included all in the training set. The final training set contained 498 pairwise alignments and can be found on the website for this paper .
We used a modified version of the Probalign beta 1.0 program more attuned to local alignment. We make two modifications to the partition function matrices. They follow from analogous standard dynamic programming recursions for local alignment and can also be found in Muckstein et. al. . First, we add 1 in the calculation of the match partition function matrix: . Second, we set the total partition function value to . The initial values of the Z-matrices also need to be set appropriately in line with the two changes. However, since we use zero end-gaps, this is automatically taken care of. We direct the reader to Additional file 1 for a more detailed description of the partition function matrices and notation. Probalign returns one alignment of the complete query against the genomic sequence. However, to produce multiple alignments of significant mean posterior probability, we provide a Perl script . This script produces multiple alignments of the query against the genomic sequence by removing the aligned portion of the genome to the query and realigning the remainder to the query until the mean posterior probability is zero. In other words, all hits above zero probability are reported. This parameter can easily be modified in the script. We evaluate only the top hit in our experiments. We use the SSEARCH +5/-4 scoring matrix for Probalign and optimize gap open, gap extension penalties and the thermodynamic temperature on the training benchmark. The modified Probalign program is available as standalone code .
We use the bl2seq program (current version 2.2.16) of the NCBI BLAST suite in our experiments. In our terminology we use BLAST to represent the bl2seq program of the suite. BLAST returns local alignments that may not include the entire query. In order to measure the error correctly, we require the entire query aligned to the genomic sequence (see Prediction Error Subsection below). We accomplish this by extending the local alignment in either direction until the full query is aligned to the genomic sequence. We also evaluate only the highest E-value BLAST hit. We actually tested the performance of the second hit outputted on each dataset and found that it had much worse error than the first. This is expected since each pairwise alignment in our benchmark is unique. We optimize BLAST gap parameters using both its default scoring matrix (+3/-1) and +5/-4 (the same one as used in SSEARCH). In order to avoid excessive scenarios where BLAST does not return an alignment, we set the minimum word size to 4. We use the +5/-4 matrix for BLAST since it performs better than the default (both with optimized parameters) on our training benchmark.
We use the current SSEARCH release version 3.4t26 in our experiments. SSEARCH is a local alignment program and may not contain the entire query aligned to the genome (necessary for correct error computation). This problem can be fixed using the same BLAST treatment described above. With the -a option, however, SSEARCH returns alignments of both query and genome sequence in their entirety. In this case we find the accuracies to match those calculated otherwise, which is by fixing the alignments if necessary. Thus, without loss of any accuracy we run SSEARCH with -a enabled. We optimize the SSEARCH gap open and gap extension penalty parameters on the training benchmark. Like BLAST, we also found the second SSEARCH hit to be significantly much worse off than the first one.
We use ClustalW version 1.83 for our experiments. ClustalW, like Probalign, returns one global alignment of the complete query against the genomic sequence. We set the terminal gap (end-gap) penalties to zero. We optimize ClustalW gap parameters on the default ClustalW scoring matrix of +10/-9 and the SSEARCH +5/-4. However, the ClustalW default matrix optimal gap parameters perform better than the optimized +5/-4 matrix.
We use HMMER version 2.3.2 in our experiments, the most current at the time of writing this paper. HMMER is designed for profile-based search that requires family alignments. Since we are interested in studying query RNA genomic search, particularly for divergent and hard cases where family alignments are not reliable, we use the single sequence RNA query for constructing the HMMER model. We use the hmmbuild program of the HMMER suite to build local alignment models (with the -f and -s options) and global alignment models (with the -g option). We then use the hmmsearch program on the training benchmark and each of the three models to search the genomic sequence for homologs of the query RNA. We find the local alignment -f and -s models to be equally the best performing and use -f in our experiments. Like BLAST and SSEARCH, HMMER local alignments may not contain the full query aligned to the genome. Therefore, we fix it in the same manner described above in the BLAST option.
Description of optimized parameters derived for each method used herein.
Gap opening penalty
Gap extension penalty
+5/-4 (T = 7)
Alignment quality measures
Probalign mean posterior probability
SSEARCH normalized Z-score
The SSEARCH Z-score and E-value are standard statistical measures of alignment reliability [32, 33]. The Z-score can be compared across different sequence pairs . We use the normalized Z-score as predictor of alignment quality. The normalized Z-score is the standard Z-score divided by the number of aligned nucleotides in the local alignment. We find this to produce a much better ROC analysis than the raw Z-score and the normalized and raw E-value.
False positive datasets
In order to measure the prediction accuracy of the above two measures we created a set of false positives. For each dataset in our benchmark, we create a false positive one by replacing the genomic sequence with one selected from a different random dataset. Now, each false positive dataset contains a query RNA and a genomic sequence containing a target RNA from a different family. We expect any alignment reliability measure to have a low value on these datasets. We make these datasets available online .
Measure of accuracy and statistical significance
Statistically significant performance differences between the various alignment methods are calculated using the Friedman rank test . This is a standard measure used for discriminating alignments in benchmarking studies [18, 36]. Roughly speaking, lower P-values coincide with reduced likelihoods that the ranking differences are due to chance. We consider P-values below 0.05 (a standard cutoff in statistics) to be statistically significant.
Correlation with true hits and true accuracy
We conduct an ROC analysis  to study how well the Probalign mean posterior probability and the SSEARCH Z-score can predict the quality of the alignment. An ROC curve plots the true positive rate (y-axis) against the false positive rate (x-axis). The area under the curve is an indicator of overall accuracy of the classifier. All ROC area under curve values are normalized to 1 with higher areas indicating higher accuracy. We treat the Probalign mean posterior probability and the SSEARCH normalized Z-scores as classifiers for a true or false hit.
Computational experiments were performed on the CIPRES cluster supported by NSF award 033-1654. DRL is supported, in part, by NIH R01 GM073082-0181. We thank system administrators at NJIT and the San Diego Supercomputing Center for their support. We also thank Kazutaka Katoh for valuable feedback on our benchmark and anonymous reviewers for commenting on the manuscript.
- Mattick JS, Makunin IV: Non-coding RNA. Hum Mol Genet 2006, 15(Spec No 1):R17-R29. 10.1093/hmg/ddl046View ArticlePubMedGoogle Scholar
- Mehler MF, Mattick JS: Non-coding RNAs in the nervous system. J Physiol 2006, 575: 333–341. 10.1113/jphysiol.2006.113191PubMed CentralView ArticlePubMedGoogle Scholar
- Eddy SR: Profile hidden Markov models. Bioinformatics 1998, 14: 755–763. 10.1093/bioinformatics/14.9.755View ArticlePubMedGoogle Scholar
- Nawrocki EP, Eddy SR: Query-Dependent Banding (QDB) for faster RNA similarity searches. PLoS Computational Biology 2007, 3(3):e56. Infernal version 0.72 [http://infernal.janelia.org] 10.1371/journal.pcbi.0030056PubMed CentralView ArticlePubMedGoogle Scholar
- Gardner PP, Wilm A, Washietl S: A benchmark of multiple sequence alignment programs based upon structural RNAs. Nucleic Acids Research 2005, 33(8):2433–2439. 10.1093/nar/gki541PubMed CentralView ArticlePubMedGoogle Scholar
- Smith TF, Waterman MS: Identification of common molecular subsequences. J Mol Biol 1981, 147: 195–197. 10.1016/0022-2836(81)90087-5View ArticlePubMedGoogle Scholar
- Freyhult EK, Bollback JP, Gardner PP: Exploring genomic dark matter: a critical assessment of the performance of homology search methods on noncoding RNA. Genome Res 2007, 17: 117–125. 10.1101/gr.5890907PubMed CentralView ArticlePubMedGoogle Scholar
- Iyer S, Deutsch K, Yan X, Lin B: Batch RNAi selector: a standalone program to predict specific siRNA candidates in batches with enhanced sensitivity. Comput Methods Programs Biomed 2007, 85: 203–209. 10.1016/j.cmpb.2006.11.004View ArticlePubMedGoogle Scholar
- Klein RJ, Eddy SR: RSEARCH: finding homologs of single structured RNA sequences. BMC Bioinformatics 2003, 4: 44. 10.1186/1471-2105-4-44PubMed CentralView ArticlePubMedGoogle Scholar
- Numata K, Kanai A, Saito R, Kondo S, Adachi J, Wilming LG, Hume DA, Hayashizaki Y, Tomita M: Identification of putative noncoding RNAs among the RIKEN mouse full-length cDNA collection. Genome Res 2003, 13: 1301–1306. 10.1101/gr.1011603PubMed CentralView ArticlePubMedGoogle Scholar
- Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ: Basic local alignment search tool. J Mol Biol 1990, 215: 403–410.View ArticlePubMedGoogle Scholar
- Miyazawa S: A reliable sequence alignment method based upon probabilities residue correspondences. Protein Engineering 1995, 8(10):999–1009. 10.1093/protein/8.10.999View ArticlePubMedGoogle Scholar
- Muckstein U, Hofacker IL, Stadler PF: Stochastic pairwise alignments. Bioinformatics 2002, 18(Suppl 2):S153-S160.View ArticlePubMedGoogle Scholar
- Roshan U, Livesay DR: Probalign: multiple sequence alignment using partition function posterior probabilities. Bioinformatics 2006, 22(22):2715–2721. 10.1093/bioinformatics/btl472View ArticlePubMedGoogle Scholar
- Do CB, Mahabhashyam MS, Brudno M, Batzoglou S: ProbCons: Probabilistic consistency-based multiple sequence alignment. Genome Res 2005, 15: 330–340. 10.1101/gr.2821705PubMed CentralView ArticlePubMedGoogle Scholar
- Katoh K, Misawa K, Kuma K, Miyata T: MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Res 2002, 30: 3059–3066. 10.1093/nar/gkf436PubMed CentralView ArticlePubMedGoogle Scholar
- Edgar RC: MUSCLE: a multiple sequence alignment method with reduced time and space complexity. BMC Bioinformatics 2004, 5: 113. 10.1186/1471-2105-5-113PubMed CentralView ArticlePubMedGoogle Scholar
- Edgar RC: MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res 2004, 32: 1792–1797. 10.1093/nar/gkh340PubMed CentralView ArticlePubMedGoogle Scholar
- Thompson JD, Koehl P, Ripp R, Poch O: BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark. Proteins 2005, 61: 127–136. 10.1002/prot.20527View ArticlePubMedGoogle Scholar
- Mizuguchi K, Deane CM, Blundell TL, Overington JP: HOMSTRAD: a database of protein structure alignments for homologous families. Protein Sci 1998, 7: 2469–2471.PubMed CentralView ArticlePubMedGoogle Scholar
- Raghava GP, Searle SM, Audley PC, Barber JD, Barton GJ: OXBench: a benchmark for evaluation of protein multiple sequence alignment accuracy. BMC Bioinformatics 2003, 4: 47. 10.1186/1471-2105-4-47PubMed CentralView ArticlePubMedGoogle Scholar
- Thompson JD, Higgins DG, Gibson TJ: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res 1994, 22: 4673–4680. 10.1093/nar/22.22.4673PubMed CentralView ArticlePubMedGoogle Scholar
- Cochrane G, Aldebert P, Althorpe N, Andersson M, Baker W, Baldwin A, Bates K, Bhattacharyya S, Browne P, van den Broek A, et al.: EMBL Nucleotide Sequence Database: developments in 2005. Nucleic Acids Res 2006, 34: D10–15. 10.1093/nar/gkj130PubMed CentralView ArticlePubMedGoogle Scholar
- Griffiths-Jones S, Moxon S, Marshall M, Khanna A, Eddy SR, Bateman A: Rfam: annotating non-coding RNAs in complete genomes. Nucleic Acids Res 2005, 33: D121–124. 10.1093/nar/gki081PubMed CentralView ArticlePubMedGoogle Scholar
- Personal communication with Alex Bateman of the RFAM database teamGoogle Scholar
- Rivas E, Eddy SR: Noncoding RNA gene detection using comparative sequence analysis. BMC Bioinformatics 2001, 2: 8. 10.1186/1471-2105-2-8PubMed CentralView ArticlePubMedGoogle Scholar
- Washietl S, Hofacker IL, Stadler PF: Fast and reliable prediction of noncoding RNAs. Proc Natl Acad Sci USA 2005, 102(7):2454–9. 10.1073/pnas.0409169102PubMed CentralView ArticlePubMedGoogle Scholar
- Coventry A, Kleitman DJ, Berger B: Multiple sequence alignments for statistical detection of RNA secondary structure. Proc Natl Acad Sci USA 2004, 101(33):12102–7. 10.1073/pnas.0404193101PubMed CentralView ArticlePubMedGoogle Scholar
- Phuong TM, Do CB, Edgar RC, Batzoglou S: Multiple alignment of protein sequences with repeats and rearrangements. Nucleic Acids Research 2006, 34(20):5932–5942. 10.1093/nar/gkl511PubMed CentralView ArticlePubMedGoogle Scholar
- Grice JA, Hughey R, Speck D: Reduced space sequence alignment. CABIOS 1997, 13(1):45–53.PubMedGoogle Scholar
- RNA-genome alignment benchmark and tools website[http://www.cs.njit.edu/usman/RNAgenome]
- Mount DW: Bioinformatics: sequence and genome analysis. 2nd edition. Cold Spring Harbor Laboratory Press, Cold Spring Harbor, NY; 2006.Google Scholar
- Pearson WR: Comparison of methods for searching protein sequence databases. Protein Science 1995, 4(6):1145–60.PubMed CentralView ArticlePubMedGoogle Scholar
- Hulsen T, de Vlieg JAM, Leunissen JMA, Groenen P: Testing statistical significance scores of sequence comparison methods with structure similarity. BMC Bioinformatics 2006, 7: 444. 10.1186/1471-2105-7-444PubMed CentralView ArticlePubMedGoogle Scholar
- Kanji GK: 100 Statistical tests. 3rd edition. Sage Publications; 2006.Google Scholar
- Thompson JD, Plewniak F, Poch O: BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics 1999, 15: 87–88. 10.1093/bioinformatics/15.1.87View ArticlePubMedGoogle Scholar
- Gribskov M, Robinson NL: Use of receiver operating characteristic (ROC) analysis to evaluate sequence matching. Comput Chem 1996, 20: 25–33. 10.1016/S0097-8485(96)80004-0View ArticlePubMedGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.