The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
WindowMasker: window-based masker for sequenced genomes
Abstract
Motivation: Matches to repetitive sequences are usually undesirable in the output of DNA database searches. Repetitive sequences need not be matched to a query, if they can be masked in the database. RepeatMasker/Maskeraid (RM), currently the most widely used software for DNA sequence masking, is slow and requires a library of repetitive template sequences, such as a manually curated RepBase library, that may not exist for newly sequenced genomes. Results: We have developed a software tool called WindowMasker (WM) that identifies and masks highly repetitive DNA sequences in a genome, using only the sequence of the genome itself. WM is orders of magnitude faster than RM because WM uses a few linear-time scans of the genome sequence, rather than local alignment methods that compare each library sequence with each piece of the genome. We validate WM by comparing BLAST outputs from large sets of queries applied to two versions of the same genome, one masked by WM, and the other masked by RM. Even for genomes such as the human genome, where a good RepBase library is available, searching the database as masked with WM yields more matches that are apparently non-repetitive and fewer matches to repetitive sequences. We show that these results hold for transcribed regions as well. WM also performs well on genomes for which much of the sequence was in draft form at the time of the analysis. Availability: WM is included in the NCBI C++ toolkit. The source code for the entire toolkit is available at . Once the toolkit source is unpacked, the instructions for building WindowMasker application in the UNIX environment can be found in file src/app/winmasker/README.build. Contact: richa@helix.nih.gov Supplementary information: Supplementary data are available at .
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
Altschul, S. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.17.3389 · Cited by 73,302
Tandem repeats finder: a program to analyze DNA sequences
Benson, G. (1999) · Nucleic Acids Research · doi:10.1093/nar/27.2.573 · Cited by 9,374
A Greedy Algorithm for Aligning DNA Sequences
Zhang, Z., Schwartz, S., Wagner, L., & Miller, W. (2000) · Journal of Computational Biology · doi:10.1089/10665270050081478 · Cited by 5,478
Abundant class of human DNA polymorphisms which can be typed using the polymerase chain reaction.
Weber, J. L., & May, P. E. (1989) · Europe PMC (PubMed Central) · Cited by 3,399
REPuter: the manifold applications of repeat analysis on a genomic scale
Kurtz, S. (2001) · Nucleic Acids Research · doi:10.1093/nar/29.22.4633 · Cited by 2,618
The complete sequence of dystrophin predicts a rod-shaped cytoskeletal protein
Koenig, M., Monaco, A. P., & Kunkel, L. M. (1988) · Cell · doi:10.1016/0092-8674(88)90383-2 · Cited by 1,538
Microsatellites are preferentially associated with nonrepetitive DNA in plant genomes
Morgante, M., Hanafey, M., & Powell, W. (2002) · Nature Genetics · doi:10.1038/ng822 · Cited by 1,161
Automated De Novo Identification of Repeat Sequence Families in Sequenced Genomes
Bao, Z., & Eddy, S. R. (2002) · Genome Research · doi:10.1101/gr.88502 · Cited by 983
Repbase Update: a database and an electronic journal of repetitive elements
Jurka, J. (2000) · Trends in Genetics · doi:10.1016/s0168-9525(00)02093-x · Cited by 883
PatternHunter: faster and more sensitive homology search
Ma, B., Tromp, J., & Li, M. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.3.440 · Cited by 829
The Alu Family of Dispersed Repetitive Sequences
Schmid, C. W., & Jelinek, W. R. (1982) · Science · doi:10.1126/science.6281889 · Cited by 597
Benson, D. A. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh045 · Cited by 492
Ancestral, Mammalian-wide Subfamilies of LINE-1 Repetitive Sequences
Smit, A. F. A., Tóth, G., Riggs, A. D., & Jurka, J. (1995) · Journal of Molecular Biology · doi:10.1006/jmbi.1994.0095 · Cited by 391
MaskerAid : a performance enhancement to RepeatMasker
Bedell, J. A., Korf, I., & Gish, W. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.11.1040 · Cited by 282
De Novo Repeat Classification and Fragment Assembly
Pevzner, P. A., Tang, H., & Tesler, G. (2004) · Genome Research · doi:10.1101/gr.2395204 · Cited by 236
McEntyre, J. R., & Ostell, J. (2002) · Cited by 210
The Atlas Genome Assembly System
Havlak, P., Chen, R., Durbin, K. J., Egan, A., Ren, Y., Song, X.-Z., Weinstock, G. M., & Gibbs, R. A. (2004) · Genome Research · doi:10.1101/gr.2264004 · Cited by 180
STAR: an algorithm to Search for Tandem Approximate Repeats
Delgrange, O., & Rivals, É. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth335 · Cited by 112
Finding Approximate Tandem Repeats in Genomic Sequences
Wexler, Y., Zohar Yakhini, B., Kashi, Y., & Geiger, D. (2005) · Journal of Computational Biology · doi:10.1089/cmb.2005.12.928 · Cited by 97
Hancock, J. M. (2002) · Genetica · doi:10.1023/a:1016028332006 · Cited by 92
RePS: A Sequence Assembler That Masks Exact Repeats Identified from the Shotgun DataPreprint
Wang, J., Wong, G. K., Ni, P., Han, Y., Huang, X., Zhang, J., Ye, C., Zhang, Y., Hu, J., Zhang, K., et al. (2002) · Genome Research · doi:10.1101/gr.165102 · Cited by 72
FORRepeats: detects repeats on entire chromosomes and between genomes
Lefebvre, A., Thierry Lecroq, B., Dauchel, H., & Alexandre, J. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btf843 · Cited by 71
Annotating Large Genomes With Exact Word MatchesPreprint
Healy, J., Thomas, E. E., Schwartz, J. T., & Wigler, M. H. (2003) · Genome Research · doi:10.1101/gr.1350803 · Cited by 70
RAP: a new computer program for de novo identification of repeated sequences in whole genomes
Campagna, D., Romualdi, C., Vitulo, N., Favero, M. D., Lexa, M., Cannata, N., & Valle, G. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bti039 · Cited by 48
Poly: a quantitative analysis tool for simple sequence repeat (SSR) tracts in DNA
Bizzaro, J. W., & Marx, K. A. (2003) · BMC Bioinformatics · doi:10.1186/1471-2105-4-22 · Cited by 29
Cited by
BLAST+: architecture and applications
Camacho, C., Coulouris, G., Avagyan, V., Ma, N., Papadopoulos, J., Bealer, K., & Madden, T. L. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-421 · Cited by 22,074
Towards complete and error-free genome assemblies of all vertebrate species
Rhie, A., McCarthy, S. A., Fedrigo, O., Damas, J., Formenti, G., Koren, S., Uliano-Silva, M., Chow, W., Fungtammasan, A., Kim, J., et al. (2021) · Nature · doi:10.1038/s41586-021-03451-0 · Cited by 3,097
Towards complete and error-free genome assemblies of all vertebrate species
Rhie, A., McCarthy, S. A., Fedrigo, O., Damas, J., Formenti, G., Koren, S., Uliano-Silva, M., Chow, W., Fungtammasan, A., Gedman, G. L., et al. (2020) · doi:10.1101/2020.05.22.110833 · Cited by 3,097
BlobToolKit – Interactive Quality Assessment of Genome Assemblies
Challis, R., Richards, E., Rajan, J., Cochrane, G., & Blaxter, M. (2020) · G3 Genes|Genomes|Genetics · doi:10.1534/g3.119.400908 · Cited by 2,610
Enhancements and modifications of primer design program Primer3
Koressaar, T., & Remm, M. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm091 · Cited by 2,603
Metadata
- Authors
- Morgulis, A., Gertz, E. M., Schäffer, A. A., & Agarwala, R.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2005-11-15
- Volume
- 22
- Issue
- 2
- Pages
- 134-141
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2142613131
- Cited by
- 311
- References
- 25
- FWCI
- 1.73
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.