The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
De novo identification of repeat families in large genomes
Abstract
MOTIVATION: De novo repeat family identification is a challenging algorithmic problem of great practical importance. As the number of genome sequencing projects increases, there is a pressing need to identify the repeat families present in large, newly sequenced genomes. We develop a new method for de novo identification of repeat families via extension of consensus seeds; our method enables a rigorous definition of repeat boundaries, a key issue in repeat analysis. RESULTS: Our RepeatScout algorithm is more sensitive and is orders of magnitude faster than RECON, the dominant tool for de novo repeat family identification in newly sequenced genomes. Using RepeatScout, we estimate that approximately 2% of the human genome and 4% of mouse and rat genomes consist of previously unannotated repetitive sequence. AVAILABILITY: Source code is available for download at http://www-cse.ucsd.edu/groups/bioinformatics/software.html
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
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
Identification of common molecular subsequences
Smith, T. F., & Waterman, M. S. (1981) · Journal of Molecular Biology · doi:10.1016/0022-2836(81)90087-5 · Cited by 9,940
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
Genome sequence of the Brown Norway rat yields insights into mammalian evolution
Rat Genome Sequencing Project Consortium, DNA sequencing: Baylor College of Medicine, Gibbs, R. A., Weinstock, G. M., Metzker, M. L., Muzny, D. M., Sodergren, E. J., Scherer, S., Scott, G., Steffen, D., et al. (2004) · Nature · doi:10.1038/nature02426 · Cited by 2,164
Self-citationMobile Elements: Drivers of Genome Evolution
Kazazian, H. H. (2004) · Science · doi:10.1126/science.1089670 · Cited by 1,922
An Eulerian path approach to DNA fragment assembly
Pevzner, P. A., Tang, H., & Waterman, M. S. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.171285098 · Cited by 1,352
Self-citationAutomated 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
The Genome Sequence of Caenorhabditis briggsae: A Platform for Comparative Genomics
Stein, L. D., Bao, Z., Blasiar, D., Blumenthal, T., Brent, M. R., Chen, N., Chinwalla, A., Clarke, L., Clee, C., Coghlan, A., et al. (2003) · PLoS Biology · doi:10.1371/journal.pbio.0000045 · Cited by 940
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
Statistics of local complexity in amino acid sequences and sequence databases
Wootton, J. C., & Federhen, S. (1993) · Computers & Chemistry · doi:10.1016/0097-8485(93)85006-x · Cited by 729
PILER: identification and classification of genomic repeats
Edgar, R. C., & Myers, E. W. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1003 · Cited by 718
REPuter: fast computation of maximal repeats in complete genomes.
Kurtz, S., & Schleiermacher, C. (1999) · Bioinformatics · doi:10.1093/bioinformatics/15.5.426 · Cited by 479
Repeats in genomic DNA: mining and meaning
Jurka, J. (1998) · Current Opinion in Structural Biology · doi:10.1016/s0959-440x(98)80067-5 · Cited by 303
Bourque, G., Pevzner, P. A., & Tesler, G. (2004) · Genome Research · doi:10.1101/gr.1975204 · Cited by 242
Self-citationDe Novo Repeat Classification and Fragment Assembly
Pevzner, P. A., Tang, H., & Tesler, G. (2004) · Genome Research · doi:10.1101/gr.2395204 · Cited by 236
Self-citationWhole-genome analysis of Alu repeat elements reveals complex evolutionary history
Price, A. L., Eskin, E., & Pevzner, P. A. (2004) · Genome Research · doi:10.1101/gr.2693004 · Cited by 213
Self-citationA clustering method for repeat analysis in DNA sequences
Volfovsky, N., Haas, B. J., & Salzberg, S. L. (2001) · Genome biology · doi:10.1186/gb-2001-2-8-research0027 · Cited by 151
A novel method for multiple alignment of sequences with repeated and shuffled elementsPreprint
Raphael, B. J., Zhi, D., Tang, H., & Pevzner, P. A. (2004) · Genome Research · doi:10.1101/gr.2657504 · Cited by 135
Self-citationComputation and visualization of degenerate repeats in complete genomes.
Kurtz, S., Ohlebusch, E., Schleiermacher, C., Stoye, J., & Giegerich, R. (2000) · PubMed · Cited by 52
The Repeat Pattern Toolkit (RPT): analyzing the structure and evolution of the C. elegans genome.
Agarwal, P., & States, D. J. (1994) · PubMed · Cited by 39
Cited by
Full-length transcriptome assembly from RNA-Seq data without a reference genome
Grabherr, M. G., Haas, B. J., Yassour, M., Levin, J. Z., Thompson, D. A., Amit, I., Adiconis, X., Fan, L., Raychowdhury, R., Zeng, Q., et al. (2011) · Nature Biotechnology · doi:10.1038/nbt.1883 · Cited by 21,039
O'Leary, N. A., Wright, M. W., Brister, J. R., Ciufo, S., Haddad, D., McVeigh, R., Rajput, B., Robbertse, B., Smith-White, B., Ako-Adjei, D., et al. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkv1189 · Cited by 6,357
“Additional data types, including PhyloCSF (20), CpGIslands, RepeatMasker (21) and Cap analysis of gene expression (CAGE) data (22), are sometimes used as additional support.”
MethodRepeatModeler2 for automated genomic discovery of transposable element families
Flynn, J. M., Hubley, R., Goubert, C., Rosen, J., Clark, A. G., Feschotte, C., & Smit, A. F. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1921046117 · Cited by 3,848
The grapevine genome sequence suggests ancestral hexaploidization in major angiosperm phyla
The French–Italian Public Consortium for Grapevine Genome Characterization (2007) · Nature · doi:10.1038/nature06148 · Cited by 3,767
Using RepeatMasker to Identify Repetitive Elements in Genomic Sequences
Tarailo‐Graovac, M., & Chen, N. (2009) · Current Protocols in Bioinformatics · doi:10.1002/0471250953.bi0410s25 · Cited by 3,398
Metadata
- Authors
- Price, A. L., Jones, N. C., & Pevzner, P. A.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2005-06-01
- Volume
- 21
- Issue
- Suppl 1
- Pages
- i351-i358
- ISSN
- 0266-7061 (ISSN-L)
- 1367-4803
- 1460-2059
- OpenAlex
- W2144268209
- Cited by
- 2,152
- References
- 20
- FWCI
- 19.50
- 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.