Detection of sequences that are homologous, i.e. descended from a common ancestor, is a fundamental task in computational biology. This task is confounded by low-complexity tracts (such as atatatatatat), which arise frequently and independently, causing strong similarities that are not homologies. There has been much research on identifying low-complexity tracts, but little research on how to treat them during homology search. We propose to find homologies by aligning sequences with “gentle” masking of low-complexity tracts. Gentle masking means that the match score involving a masked letter is , where is the unmasked score. Gentle masking slightly but noticeably improves the sensitivity of homology search (compared to “harsh” masking), without harming specificity. We show examples in three useful homology search problems: detection of NUMTs (nuclear copies of mitochondrial DNA), recruitment of metagenomic DNA reads to reference genomes, and pseudogene detection. Gentle masking is currently the best way to treat low-complexity tracts during homology search.
Citation: Frith MC (2011) Gentle Masking of Low-Complexity Sequences Improves Homology Search. PLoS ONE 6(12): e28819. https://doi.org/10.1371/journal.pone.0028819
Editor: Leonardo Mariño-Ramírez, National Institutes of Health, United States of America
Received: October 17, 2011; Accepted: November 15, 2011; Published: December 19, 2011
Copyright: © 2011 Martin C. Frith. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Funding: This author has no support or funding to report.
Competing interests: The authors have declared that no competing interests exist.
The problem of false homology prediction due to low-complexity sequences is sufficiently severe that it has been addressed since the early days of computational biology. Methods to avoid this problem can be classified into three approaches:
The first approach is to identify low-complexity regions by some means, and then replace each letter in these regions with a dummy letter, typically X for proteins and N for DNA. During alignment, the dummy letter receives a negative match score when aligned to anything. For example, in the NCBI blosum matrices, X receives a score of −1. This prevents low-complexity regions from getting high alignment scores.
This approach obviously depends on the means of identifying low-complexity regions. We recently showed that standard methods such as SegMasker and DustMasker are not perfect: they fail to mask some low-complexity sequences, which then produce strong (E-value ), non-homologous alignments . We also described a new masking method, tantan, which prevents non-homologous alignments much more reliably.
The second approach is to indicate low-complexity regions with lowercase letters, instead of dummy letters. This leaves all options open: some alignment tools can treat lowercase identically to dummy letters. A popular method, however, is to exclude lowercase from the initial “seeding” phase of the alignment algorithm, but to treat lowercase identically to uppercase during the subsequent “extension” phase. (This only makes sense for alignment tools that use a seed-and-extend algorithm.) This method is used by blastz and lastz, which are employed to construct the widely-used UCSC genome alignments –. It is also used by the NCBI's blastn and megablast .
Unfortunately, excluding low-complexity regions from seeding but not extension fails to prevent spurious alignments , . If we wish to thoroughly avoid non-homologous alignments, we must mask low-complexity regions at all stages of the homology search procedure.
It might be objected that masking at all stages of homology search will mutilate alignments of genuinely homologous sequences. It may break them into smaller alignments, and prevent alignment of mildly low-complexity regions whose homology is supported by surrounding high-complexity regions. We can avoid this mutilation as follows. After identifying homologous regions, re-align them with masking turned off, allowing the re-alignments to extend beyond the regions and merge nearby alignments. This re-alignment is naturally achieved by repeating the extend step of a seed-and-extend algorithm. We know of only two alignment tools that perform this careful variant of soft masking: fasta and last , .
The final approach is to adjust the alignment score and/or significance estimate, based on the letter frequencies. NCBI blastp (and tblastn ) can use either compositional scaling (a.k.a. composition-based statistics) , or compositional score matrix adjustment . These methods aim not only to avoid spurious alignments, but also to discriminate homologs with non-standard letter frequencies in a statistically powerful manner. blastz and lastz adjust alignment scores based on the entropy of their nucleotides . Among other tools, MSPcrunch filters alignments with biased letter frequencies , and hmmer3 uses a score correction for biased composition .
To the best of our knowledge, all methods in this category consider only zero-order letter frequencies, and not tandem repeats. Since tandem repeats often cause strong, non-homologous similarities , these methods do not suffice to avoid spurious alignments.
For example, Figure 1 shows a blastp search with a reversed protein (B6D5L7_PERAZ) against the nr database, using “conditional compositional score matrix adjustment” (the default setting as of 2011-06-20). The search found 221 hits, including 21 with E-value less than . Since sequences do not evolve by reversal, these alignments are not homologies. These alignments are due to a period-28 tandem repeat in B6D5L7_PERAZ, which, after reversal, matches tandem repeats in other proteins (with period not necessarily 28, see Figure 2B of ).
This is the output of a blastp search with a reversed protein (B6D5L7_PERAZ) against the nr database at NCBI.
In summary, the only reliable way to avoid false homology predictions is to mask the sequences with tantan, and apply this masking at all stages of the homology search algorithm. (We have not tested all other methods that have ever been published, but we have tested several widely-used ones , .) Another way to state this is that tantan makes alignment E-values useful. For example, if we perform homology search using tantan and an E-value threshold of 10, the number of spurious alignments is likely to be around 10, and the strongest spurious alignment is unlikely to have an E-value much less than 1. Using a method other than tantan, the number of spurious alignments might exceed 1000, and the strongest one might have an E-value less than .
Since tantan typically masks less than 10% of letters, we do not expect it to greatly decrease the sensitivity of homology search . We noticed, however, that it occasionally blocks some alignments that we suspect are true homologies. Here we present a new method, gentle masking, which rescues these blocked alignments. This does not change the procedure for identifying low-complexity regions, but rather it changes the way they are treated during homology search.
A new method: gentle masking
The old method, “harsh” masking, assigns a negative score for a match between a lowercase letter and any other letter. In our previous publication on tantan, we used the lowest score in the scoring matrix. For DNA we usually use +1/−1 match/mismatch scores, so the score for a masked letter would be −1. For protein alignments with the blosum62 matrix, it would be −4.
With gentle masking, the score for matching two letters when either (or both) are lowercase is: , where is the score when both letters are uppercase. We implemented this by enlarging the score matrix, to include separate entries for uppercase and lowercase letters (e.g. Table 1). This means that the alignment algorithm needs no change.
Gentle masking improves the sensitivity of homology search
NUMTs: There have been many studies of NUMTs, which are copies of mitochondrial DNA in nuclear genomes . A key step in NUMT identification is to find regions of the nuclear genome with homology to the mitochondrial genome, which is a standard homology search problem. (An additional step might be to distinguish transferred DNA from DNA that has been conserved since the common ancestor of eukaryotes and mitochondria: we do not attempt that here.)
We looked for NUMTs in several nuclear genomes, using either harsh masking or gentle masking of low-complexity regions identified by tantan. The difference is not great, but we found a few extra NUMTs using gentle masking (Table 2). In particular, we found the single previously-reported NUMT in C. elegans  only when we used gentle masking.
The C. elegans NUMT is not trivial to find, because large parts of it are deemed low-complexity by tantan (Figure 2). The un-masked parts of this alignment are collectively strong enough to be statistically significant: the alignment score with gentle-masking applied is 45, for an E-value of .
The main reason tantan masks this NUMT is that it contains a period-45 tandem repeat. Such longish period repeats can indeed cause spurious alignments . An accidental property of tantan is that it tends not to mask the left-most repeat unit (blue arrowheads). Although this is awkwardly asymmetric, it allows more sensitive homology search, as this example shows.
Metagenomic DNA reads: There is great interest in analyzing collections of DNA sequences from various environments, such as the human gut or seawater. In these experiments the sequencing instrument generates many short DNA reads, which must then be interpreted. One standard analysis is to align the reads to a catalog of microbial genome sequences, which may indicate the taxonomic groups that many of the reads come from. This is also a homology search problem.
We aligned 1 million 75 bp Illumina reads to a catalog of 194 microbial genomes, using data conveniently provided from a previous study , . In this test we used an E-value threshold of around 0.01 per read, which means that we expect about 10,000 spurious alignments. Using harsh masking, we matched 543,115 reads to at least one genome. Using gentle masking, we matched all of these same reads, plus an additional 703 reads. This is a very small increase in sensitivity, but an increase nonetheless. Only 6% of the reads contain tantan low-complexity regions, so the difference was bound to be small. Figure 3 shows an example that was found with gentle masking but not with harsh masking. As above, the un-masked parts of this alignment are collectively significant: the gentle-masked alignment score is 37, for an E-value of .
The upper sequence is the DNA read “1_lane2_104963”; the lower sequence is from the genome “A1-86”. Lowercase red letters were masked by tantan.
As a negative control, we reversed the reads (without complementing them) and then aligned them to the genomes. With harsh masking 7,907 were aligned, and with gentle masking 7,910 were aligned. This suggests that gentle masking decreases the specificity of the search by less than it increases the sensitivity.
Protein-coding homology: It is useful to identify segments of a genome that are homologous to protein-coding DNA. Such segments are usually either protein-coding exons, or pseudogene fragments. One reason this is useful is to explain evolutionarily-conserved segments of the genome. Searches for conserved non-protein-coding segments tend to hit recent pseudogenes, because they have indeed been conserved for much of their evolutionary history. This is not always obvious, because comprehensive pseudogene annotation is lacking.
We identified segments of the human genome with protein-coding homology, by finding local alignments between the genome and known proteins in the UniRef90 database. We used “three-frame alignment”, which translates the DNA in all reading frames and aligns the amino acids allowing frame-shifts . (We used both DNA strands, so six frames in total.) With gentle masking of low-complexity regions, we identified 225,002 genomic segments. With harsh masking, we failed to identify 6,422 of these (no overlap), and found only 2 segments not found with gentle masking. Thus, gentle masking slightly increased the sensitivity.
As an example, the upper alignment in Figure 4 was found with gentle masking, but not with harsh masking. This alignment corresponds to an exon of the known gene PLEKHN1. The lower alignment in Figure 4 shows the next downstream exon: this provides independent evidence that the upper alignment is not a spurious match.
This shows two local alignments between a protein (Q494U1, upper sequence) and human chromosome 1 (lower sequence). Lowercase red letters were masked by tantan. The upper alignment was found with gentle masking, but not with harsh masking.
It might be argued that our harsh masking is a straw man, because we used a mask score of −6 (the lowest score in blosum80), whereas, for example, blast uses a score of −1 for X residues. To address this concern, we repeated the search after replacing masked letters with X, with score −1. To make a fair comparison, we also repeated our gentle masking search without the final step of realignment without masking. In this case, with gentle masking we found 227,018 segments (more than before, because the final realignment step merges some segments). With X masking, we failed to find 1,640 of these, and found 43 segments not found with gentle masking. So gentle masking still improves the sensitivity.
Gentle masking does not harm the specificity of homology search
It is impossible to prove that any method will always suppress spurious alignments: the best we can do is to test it on a variety of datasets. In order to provide as much support for gentle masking as we obtained previously for harsh masking, we repeated exactly the same tests as . The short story is that the test results with gentle masking are almost identical to those with harsh masking, which means that gentle masking suppresses spurious alignments just as well.
In each of these tests, we look for local alignments between a set of reversed sequences and a set of non-reversed sequences. Since sequences do not evolve by reversal, there are no true homologies. With insufficient low-complexity masking, however, we observe strong alignments with significant E-values (Figure 1).
In the first test, we compared the C. elegans genome to the reversed P. pacificus genome, gentle masking both with tantan (Figure 5A). The number of alignments (red line) agrees closely with the number obtained after shuffling the genomes (brown line) and the number expected from E-value calculations (black line). The number of alignments found after shuffling is less than theoretically expected because we used a heuristic search tool (last) which misses some alignments. In any case, spurious alignments were thoroughly suppressed.
This shows alignments between: (A) the C. elegans genome and the reversed P. pacificus genome; (B) the A. thaliana genome and the reversed P. patens genome; (C) vertebrate proteins and reversed plant proteins; (D) the human genome and the reversed opossum genome; (E) the P. falciparum genome and the reversed D. discoideum genome; (F) the P. falciparum genome and the reversed human genome. The colors indicate alignments after: masking both sets of sequences (solid red); masking the first-named set only (dotted magenta); masking the second-named set only (dashed blue); shuffling the letters in each set (dashed brown). The black lines indicate the expected number of alignments for random sequences.
We obtained similar results when comparing five other pairs of DNA or protein datasets (Figure 5B–F). The results are not “perfect”: for instance, in Figure 5D we clearly find more and stronger alignments in the reversed comparison (red line) than the shuffled comparison (brown line). Moreover, masking only one set of sequences in each pair (blue and purple lines) was sometimes less effective. In all cases, however, the results with gentle masking are extremely similar to our previous results with harsh masking (Figure 5 in ).
The DNA alignments of Figure 5 all used the same scoring scheme: match = , mismatch = , gap = . We repeated three of these tests using a different scoring scheme: the hoxd70 score matrix with a gap score of . Again, we did not observe excessive spurious alignments after masking both sets of sequences (Figure 6, red lines). These results with gentle masking are also highly similar to our earlier results with harsh masking (Figure S7 in ).
Alignments between: (A) the C. elegans genome and the reversed P. pacificus genome; (B) the A. thaliana genome and the reversed P. patens genome; (C) the human genome and the reversed opossum genome. The colors indicate alignments after: masking both sets of sequences (solid red); masking the first-named set only (dotted magenta); masking the second-named set only (dashed blue); shuffling the letters in each set (dashed brown). The black lines indicate the expected number of alignments for random sequences.
Finally, we compared DNA sequences to reversed protein sequences (Figure 7). In order to exactly mimic the test in our previous publication, we did not allow frameshifts. Once again, the results with gentle masking are extremely similar to those with harsh masking (Figure 7 in ).
This shows alignments between: (A) the C. elegans genome and reversed plant proteins; (B) the P. falciparum genome and reversed vertebrate proteins. The colors indicate alignments after: masking the proteins, and the DNA at the protein level (solid red); masking the proteins, and the DNA at the DNA level (solid blue); masking the proteins only (dashed red); masking the DNA only, at the DNA level (dashed blue); shuffling the letters in each set (dashed brown). The black lines indicate the expected number of alignments for random sequences.
Why not use a mask score of 0?
An alternative to gentle masking is to assign a score of zero for a match between a masked letter and any other letter. This idea has several problems, however: it leads to over-extended alignments such as that in Figure 8, and it makes blast-like algorithms slow because they would explore alignment extensions across the whole length of every masked region that they encounter. It also complicates the final step of realignment without masking, because optimal unmasked alignments might be multiple fragments of an optimal masked alignment. Our gentle (and harsh) masking method avoids this problem by guaranteeing that the masked score cannot exceed the unmasked score.
Masking versus modeling
A more sophisticated way to avoid false homology predictions would be to use probabilistic models. The standard approach to sequence alignment, using a score matrix, can be interpreted as comparing a model of related sequences to a model of independent sequences . It might be possible to incorporate low-complexity regions into both of these models. In fact, tantan is based on a probabilistic model of sequences with low-complexity regions . Thus, it might be possible to construct a principled and extremely accurate homology search method by combining the tantan model with the alignment models.
The main advantage of gentle masking is that it actually exists now. (last enlarges the score matrix as in Figure 1.) The modeling approach seems to us not entirely easy to implement. It would surely complicate the alignment algorithm, perhaps making it slow, and making it difficult to retrofit into existing methods like blast. This would hamper its adoption by the bioinformatics community.
Profile-based homology search
Profile-based methods are often more powerful than pairwise sequence comparison at finding remote protein homologs , , . For methods like psi-blast that use a position specific scoring matrix (PSSM), gentle masking generalizes in an obvious way: if is the PSSM score for (uppercase) letter at position , then . On the other hand, it is not obvious whether or how one should identify low-complexity tracts in a PSSM. For methods like hmmer that use explicit probabilistic models, it seems more logical to incorporate a model of low-complexity regions, as mentioned in the preceding subsection.
Pairwise sequence comparison (without profiles) remains frequently useful, as illustrated by the three examples in this study. Moreover, pairwise sequence comparison is needed for gathering homologs to construct profiles in the first place. In this homolog-gathering step, it is often particularly important to avoid contamination by non-homologous sequences: our masking approach should be very useful here.
Interspersed repeats are not low complexity
Interspersed repeats and low-complexity sequences are often lumped together as “repeats”, so we must constantly point out the differences between them. Interspersed repeats (such as LINEs and SINEs) do not cause false homology predictions, because, for example, every LINE-1 element is genuinely homologous to every other LINE-1 element. They may cause other problems, such as making sequence comparison algorithms run too slowly and produce too much output. So it can be useful to lowercase-mask both low-complexity regions (using tantan) and interspersed repeats (several tools exist). Gentle masking would then operate on both types of repeat, which seems harmless. (In fact, we did this in our protein-coding homology search.)
Masking and orthology search
Low-complexity masking is important for accurate homology search, but its application to orthology search is less clear. Prominent examples of orthology search include: comparing two whole genomes, and aligning human DNA reads to a reference human genome. In these cases, we usually wish to avoid paralogous alignments. The danger is that we might mask an ortholog but not a paralog, and thus increase the rate of paralog alignments. This seems especially likely with short sequences, where any masking is more likely to cover the whole ortholog. On the other hand, if we have DNA reads with contaminants (e.g. bacterial), there is a risk of spurious low-complexity matches between the contaminants and the genome. We speculate that it might be useful to apply low-complexity filtering as a final step, after identifying orthologs.
Homology search versus alignment
Homology search has two somewhat different aspects: 1) finding homologous regions, and 2) aligning homologous letters within those regions. This study addresses only the first aspect. There have been several studies on the accuracy of letter alignment (e.g. , ), but to our knowledge none have examined the effect of low-complexity tracts. Such tracts are likely to have a significant effect: for example, they are likely to exacerbate over-extension of local alignments . Research into the effect of low-complexity tracts on letter alignment would be useful.
Gentle masking is an extremely simple but useful way to treat lowercase-masked low-complexity tracts during sequence alignment. In tests with reversed sequences, gentle masking with tantan suppressed spurious alignments in a practically identical manner to harsh masking with tantan. On the other hand, in three tests using real (non-reversed) sequences, gentle masking resulted in slightly but noticeably more alignments than harsh masking. Since both methods suppress spurious alignments equally well, we infer that these extra alignments are largely true homologies. In support of this conclusion, some of the extra alignments have highly significant E-values (which are never observed for reversed sequences), and some of the putative protein-coding homologs are supported by neighbouring exons.
Materials and Methods
Tests of specificity
Tests of sensitivity
All: In all of these tests, we masked both sets of sequences (query and reference) using tantan version 4 . We found alignments using last: version 163 for harsh masking, and version 164 in all other cases . E-values were calculated with lastex .
In an abundance of caution, we made sure that the DNA strands were treated symmetrically, despite tantan's directional asymmetry. We first compared forward strands only, using lastal option -s1. We then reverse-complemented the original (un-tantan'd) query sequences, ran tantan on these, and fed them to lastal using option -s1 again.
This cautious treatment of strands is the reason why our results with the metagenome data are not identical to the results we obtained earlier .
NUMTs: We downloaded these genomes from the UCSC genome database: cb3, ce6, dm3, hg19, mm9 , . The mitochondrial genomes are circular, but are represented as linearized sequences. Therefore we doubled these sequences, in order to find alignments that cross the break.
We set the alignment score threshold to the minimum score with E-value0.01. For example, the score threshold for C. elegans was 36. (E-values were calculated before doubling the mtDNA.)
We obtained a count of NUMTs as follows. We recorded the segment of the nuclear genome covered by each alignment, discarding the mitochondrial coordinates and all strand information. We then merged overlapping and touching segments. Finally, NUMTs found by one method but not the other are defined to be segments found by one method that have no overlap with segments found by the other.
Metagenomic DNA reads: One of the genomes that we downloaded (Acidaminococcus_D21) has other genomes spuriously appended to it, so we used only the first 2,238,973 bases of this sequence.
We ran lastal with options -d20 -e25. This means that we used a score threshold of 25, for a E-value of about 0.0188 per read.
In the test with reversed reads, masking was done before reversal.
The proteins were masked using tantan options -p -r0.02, as recommended for DNA-versus-protein alignment . The DNA was masked using option -c, which preserves the lowercase masking done by UCSC. We did this because a few proteins match interspersed repeats (due to exaptation), and we wished to avoid these numerous alignments.
We aligned the DNA and the proteins using lastal with options -pBLOSUM80 -F15 -e137. The score threshold of 137 corresponds to an E-value of about 0.01.
We used blosum80 instead of the more standard blosum62 for two reasons. First, blosum80 is more powerful at discriminating short, strong homologies from chance matches (e.g. Figure 9A) . Second, blosum62 is more prone to over-extending alignments (e.g. Figure 9B) .
(A) An alignment that is significant when scored with blosum80 but not blosum62. (B) Two local alignments between a protein (Q9BZQ4, upper sequence) and human chromosome 1 (lower sequence). The blue arrowheads indicate spurious over-extension of the second alignment. This over-extension occurs when the blosum62 matrix is used for alignment, but not when blosum80 is used. (Actually, it is conceivable that the extension correctly indicates homology: the genomic segment marked by blue arrowheads could be paralogous to the genomic segment in the first alignment.)
We counted protein-coding segments in the same way that we counted NUMT segments, with one difference: this time, we treated segments on opposite strands of a chromosome as distinct.
I thank Junko Tsuji for noticing the missing C. elegans NUMT which motivated this project. I thank Paul Horton for helpful discussions about masking and comments on the manuscript. The three-frame alignment algorithm was implemented by Toshiyuki Sato of Mizuho Information & Research Institute.
Conceived and designed the experiments: MCF. Performed the experiments: MCF. Analyzed the data: MCF. Contributed reagents/materials/analysis tools: MCF. Wrote the paper: MCF.
- 1. Frith M (2011) A new repeat-masking method enables specific detection of homologous sequences. Nucleic Acids Res 39: e23.M. Frith2011A new repeat-masking method enables specific detection of homologous sequences.Nucleic Acids Res39e23
- 2. Schwartz S, Kent W, Smit A, Zhang Z, Baertsch R, et al. (2003) Human-mouse alignments with BLASTZ. Genome Res 13: 103–107.S. SchwartzW. KentA. SmitZ. ZhangR. Baertsch2003Human-mouse alignments with BLASTZ.Genome Res13103107
- 3. Harris R (2007) Improved pairwise alignment of genomic DNA. R. Harris2007Improved pairwise alignment of genomic DNA.Ph.D. thesis, The Pennsylvania State University. Ph.D. thesis, The Pennsylvania State University.
- 4. Miller W, Rosenbloom K, Hardison R, Hou M, Taylor J, et al. (2007) 28-way vertebrate alignment and conservation track in the UCSC genome browser. Genome Res 17: 1797–1808.W. MillerK. RosenbloomR. HardisonM. HouJ. Taylor200728-way vertebrate alignment and conservation track in the UCSC genome browser.Genome Res1717971808
- 5. Camacho C, Coulouris G, Avagyan V, Ma N, Papadopoulos J, et al. (2009) BLAST+: architecture and applications. BMC Bioinformatics 10: 421.C. CamachoG. CoulourisV. AvagyanN. MaJ. Papadopoulos2009BLAST+: architecture and applications.BMC Bioinformatics10421
- 6. Frith M, Hamada M, Horton P (2010) Parameters for accurate genome alignment. BMC Bioinformatics 11: 80.M. FrithM. HamadaP. Horton2010Parameters for accurate genome alignment.BMC Bioinformatics1180
- 7. Pearson W, Lipman D (1988) Improved tools for biological sequence comparison. Proc Natl Acad Sci USA 85: 2444–2448.W. PearsonD. Lipman1988Improved tools for biological sequence comparison.Proc Natl Acad Sci USA8524442448
- 8. Gertz E, Yu Y, Agarwala R, Schaffer A, Altschul S (2006) Composition-based statistics and translated nucleotide searches: improving the TBLASTN module of BLAST. BMC Biol 4: 41.E. GertzY. YuR. AgarwalaA. SchafferS. Altschul2006Composition-based statistics and translated nucleotide searches: improving the TBLASTN module of BLAST.BMC Biol441
- 9. Schaffer A, Aravind L, Madden T, Shavirin S, Spouge J, et al. (2001) Improving the accuracy of PSI-BLAST protein database searches with composition-based statistics and other refinements. Nucleic Acids Res 29: 2994–3005.A. SchafferL. AravindT. MaddenS. ShavirinJ. Spouge2001Improving the accuracy of PSI-BLAST protein database searches with composition-based statistics and other refinements.Nucleic Acids Res2929943005
- 10. Altschul S, Wootton J, Gertz E, Agarwala R, Morgulis A, et al. (2005) Protein database searches using compositionally adjusted substitution matrices. FEBS J 272: 5101–5109.S. AltschulJ. WoottonE. GertzR. AgarwalaA. Morgulis2005Protein database searches using compositionally adjusted substitution matrices.FEBS J27251015109
- 11. Chiaromonte F, Yap V, Miller W (2002) Scoring pairwise genomic sequence alignments. Pac Symp Biocomput 7: 115–126.F. ChiaromonteV. YapW. Miller2002Scoring pairwise genomic sequence alignments.Pac Symp Biocomput7115126
- 12. Forslund K, Sonnhammer E (2009) Benchmarking homology detection procedures with low complexity filters. Bioinformatics 25: 2500–2505.K. ForslundE. Sonnhammer2009Benchmarking homology detection procedures with low complexity filters.Bioinformatics2525002505
- 13. HMMER website. HMMER website.Available: http://hmmer.org/. Accessed 2011. Available: http://hmmer.org/. Accessed 2011.
- 14. Hazkani-Covo E, Zeller R, Martin W (2010) Molecular poltergeists: mitochondrial DNA copies (numts) in sequenced nuclear genomes. PLoS Genet 6: e1000834.E. Hazkani-CovoR. ZellerW. Martin2010Molecular poltergeists: mitochondrial DNA copies (numts) in sequenced nuclear genomes.PLoS Genet6e1000834
- 15. Niu B, Zhu Z, Fu L, Wu S, Li W (2011) FR-HIT, a very fast program to recruit metagenomic reads to homologous reference genomes. Bioinformatics 27: 1704–1705.B. NiuZ. ZhuL. FuS. WuW. Li2011FR-HIT, a very fast program to recruit metagenomic reads to homologous reference genomes.Bioinformatics2717041705
- 16. Qin J, Li R, Raes J, Arumugam M, Burgdorf K, et al. (2010) A human gut microbial gene catalogue established by metagenomic sequencing. Nature 464: 59–65.J. QinR. LiJ. RaesM. ArumugamK. Burgdorf2010A human gut microbial gene catalogue established by metagenomic sequencing.Nature4645965
- 17. Zhang Z, Pearson W, Miller W (1997) Aligning a DNA sequence with a protein sequence. J Comput Biol 4: 339–349.Z. ZhangW. PearsonW. Miller1997Aligning a DNA sequence with a protein sequence.J Comput Biol4339349
- 18. Altschul S (1991) Amino acid substitution matrices from an information theoretic perspective. J Mol Biol 219: 555–565.S. Altschul1991Amino acid substitution matrices from an information theoretic perspective.J Mol Biol219555565
- 19. Biegert A, Soeding J (2009) Sequence context-specific profiles for homology searching. Proc Natl Acad Sci U S A 106: 3770–3775.A. BiegertJ. Soeding2009Sequence context-specific profiles for homology searching.Proc Natl Acad Sci U S A10637703775
- 20. Lunter G, Rocco A, Mimouni N, Heger A, Caldeira A, et al. (2008) Uncertainty in homology inferences: assessing and improving genomic sequence alignment. Genome Res 18: 298–309.G. LunterA. RoccoN. MimouniA. HegerA. Caldeira2008Uncertainty in homology inferences: assessing and improving genomic sequence alignment.Genome Res18298309
- 21. Frith M, Park Y, Sheetlin S, Spouge J (2008) The whole alignment and nothing but the alignment: the problem of spurious alignment flanks. Nucleic Acids Res 36: 5863–5871.M. FrithY. ParkS. SheetlinJ. Spouge2008The whole alignment and nothing but the alignment: the problem of spurious alignment flanks.Nucleic Acids Res3658635871
- 22. Kielbasa S, Wan R, Sato K, Horton P, Frith M (2011) Adaptive seeds tame genomic sequence comparison. Genome Res 21: 487–493.S. KielbasaR. WanK. SatoP. HortonM. Frith2011Adaptive seeds tame genomic sequence comparison.Genome Res21487493
- 23. Sheetlin S, Park Y, Spouge J (2005) The Gumbel pre-factor k for gapped local alignment can be estimated from simulations of global alignment. Nucleic Acids Res 33: 4987–4994.S. SheetlinY. ParkJ. Spouge2005The Gumbel pre-factor k for gapped local alignment can be estimated from simulations of global alignment.Nucleic Acids Res3349874994
- 24. Frith M (2011) Comments on recruiting metagenomic reads to homologous reference genomes. M. Frith2011Comments on recruiting metagenomic reads to homologous reference genomes.Bioinformatics. Available: http://bioinformatics.oxfordjournals.org/content/27/12/1704/reply. Bioinformatics. Available: http://bioinformatics.oxfordjournals.org/content/27/12/1704/reply.
- 25. Fujita P, Rhead B, Zweig A, Hinrichs A, Karolchik D, et al. (2011) The UCSC genome browser database: update 2011. Nucleic Acids Res 39: D876–82.P. FujitaB. RheadA. ZweigA. HinrichsD. Karolchik2011The UCSC genome browser database: update 2011.Nucleic Acids Res39D87682
- 26. UCSC genome browser. UCSC genome browser.Available: http://genome.ucsc.edu/. Accessed 2011. Available: http://genome.ucsc.edu/. Accessed 2011.
- 27. Suzek B, Huang H, McGarvey P, Mazumder R, Wu C (2007) UniRef: comprehensive and nonredundant UniProt reference clusters. Bioinformatics 23: 1282–1288.B. SuzekH. HuangP. McGarveyR. MazumderC. Wu2007UniRef: comprehensive and nonredundant UniProt reference clusters.Bioinformatics2312821288