{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T22:06:30Z","timestamp":1774044390134,"version":"3.50.1"},"reference-count":21,"publisher":"Oxford University Press (OUP)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,2,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: Repeats are ubiquitous in genomes and play important roles in evolution. Transposable elements are a common kind of repeat. Transposon insertions can be nested and make the task of identifying repeats difficult.<\/jats:p>\n               <jats:p>Results: We develop a novel iterative algorithm, called Greedier, to find repeats in a target genome given a repeat library. Greedier distinguishes itself from existing methods by taking into account the fragmentation of repeats. Each iteration consists of two passes. In the first pass, it identifies the local similarities between the repeat library and the target genome. Greedier then builds graphs from this comparison output. In each graph, a vertex denotes a similar subsequence pair. Edges denote pairs of subsequences that can be connected to form higher similarities. In the second pass, Greedier traverses these graphs greedily to find matches to individual repeat units in the repeat library. It computes a fitness value for each such match denoting the similarity of that match. Matches with fitness values greater than a cutoff are removed, and the rest of the genome is stitched together. The similarity cutoff is then gradually reduced, and the iteration is repeated until no hits are returned from the comparison. Our experiments on the Arabidopsis and rice genomes show that Greedier identifies approximately twice as many transposon bases as those found by cross_match and WindowMasker. Moreover, Greedier masks far fewer false positive bases than either cross_match or WindowMasker. In addition to masking repeats, Greedier also reports potential nested transposon structures.<\/jats:p>\n               <jats:p>Contact: \u00a0xli@cise.ufl.edu<\/jats:p>","DOI":"10.1093\/bioinformatics\/btm613","type":"journal-article","created":{"date-parts":[[2007,12,19]],"date-time":"2007-12-19T03:48:23Z","timestamp":1198036103000},"page":"468-476","source":"Crossref","is-referenced-by-count":14,"title":["A novel genome-scale repeat finder geared towards transposons"],"prefix":"10.1093","volume":"24","author":[{"given":"Xuehui","family":"Li","sequence":"first","affiliation":[{"name":"1 CISE Department and 2Plant Molecular and Cellular Biology Program and Horticultural Sciences Department, University of Florida, Gainesville, FL 32611, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamer","family":"Kahveci","sequence":"additional","affiliation":[{"name":"1 CISE Department and 2Plant Molecular and Cellular Biology Program and Horticultural Sciences Department, University of Florida, Gainesville, FL 32611, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. Mark","family":"Settles","sequence":"additional","affiliation":[{"name":"1 CISE Department and 2Plant Molecular and Cellular Biology Program and Horticultural Sciences Department, University of Florida, Gainesville, FL 32611, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2007,12,18]]},"reference":[{"key":"2023020209510127600_B1","doi-asserted-by":"crossref","first-page":"1040","DOI":"10.1093\/bioinformatics\/16.11.1040","article-title":"MaskerAid: a performance enhancement to RepeatMasker","volume":"16","author":"Bedell","year":"2000","journal-title":"Bioinformatics"},{"key":"2023020209510127600_B2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0966-842X(96)10042-1","article-title":"The contributions of retroelements to plant genome organization, function and evolution","volume":"4","author":"Bennetzen","year":"1996","journal-title":"Trends Microbiol"},{"key":"2023020209510127600_B3","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1016\/j.pbi.2004.09.003","article-title":"Consistent over-estimation of gene number in complex plant genomes","volume":"7","author":"Bennetzen","year":"2004","journal-title":"Curr. Opin. Plant Biol"},{"key":"2023020209510127600_B4","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1093\/nar\/27.2.573","article-title":"Tandem repeats finder: a program to analyze DNA sequences","volume":"27","author":"Benson","year":"1999","journal-title":"Nucleic Acids Research"},{"key":"2023020209510127600_B5","first-page":"65","article-title":"Transposable elements and the evolution of eukaryotic complexity","volume":"4","author":"Bowen","year":"2002","journal-title":"Curr. Issues Mol. Biol"},{"key":"2023020209510127600_B6","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1038\/ng0497-327","article-title":"Big, bad minisatellites","volume":"15","author":"Buard","year":"1997","journal-title":"Nature Genetics"},{"key":"2023020209510127600_B7","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1093\/bioinformatics\/bti039","article-title":"RAP: a new computer program for de novo identification of repeated sequences in whole genomes","volume":"21","author":"Campagna","year":"2005","journal-title":"Bioinformatics"},{"key":"2023020209510127600_B8","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1101\/gr.4361206","article-title":"Identification of transposable elements using multiple alignments of related genomes","volume":"16","author":"Caspi","year":"2006","journal-title":"Genome Research"},{"key":"2023020209510127600_B9","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1038\/35057062","article-title":"Initial sequenccing and analysis of the human genome","volume":"409","author":"Consortium","year":"2001","journal-title":"Nature"},{"key":"2023020209510127600_B10","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1017\/CBO9780511790492","volume-title":"Biological Sequence Analysis.","author":"Durbin","year":"1998"},{"key":"2023020209510127600_B11","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1093\/bioinformatics\/bti1003","article-title":"PILER: identification and classification of genomic repeats","volume":"21","author":"Edgar","year":"2005","journal-title":"Bioinformatics"},{"key":"2023020209510127600_B12","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","article-title":"An improved algorithm for matching biological sequences","volume":"162","author":"Gotoh","year":"1982","journal-title":"J. Mol. Biol"},{"key":"2023020209510127600_B13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0097-8485(96)80013-1","article-title":"CENSOR - a program for identification and elimination of repetitive elements from DNA sequences","volume":"20","author":"Jurka","year":"1996","journal-title":"Comput. Chem"},{"key":"2023020209510127600_B14","first-page":"228","article-title":"Computation and visualization of degenerate repeats in complete genomes","volume-title":"Intelligent Systems for Molecular Biology (ISMB).","author":"Kurtz","year":"2000"},{"key":"2023020209510127600_B15","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1101\/gr.1466204","article-title":"Analyses of LTR-retrotransposon structures reveal recent and rapid genomic DNA loss in rice","volume":"14","author":"Ma1","year":"2004","journal-title":"Genome Research"},{"key":"2023020209510127600_B16","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1093\/bioinformatics\/btf878","article-title":"LTR STRUC: a novel search and identification program for LTR retrotransposons","volume":"19","author":"McCarthy","year":"2003","journal-title":"Bioinformatics"},{"key":"2023020209510127600_B17","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1093\/bioinformatics\/bti774","article-title":"WindowMasker: window-based masker for sequenced genomes","volume":"22","author":"Morgulis","year":"2006","journal-title":"Bioinformatics"},{"key":"2023020209510127600_B18","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","article-title":"A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins","volume":"48","author":"Needleman","year":"1970","journal-title":"Journal of Molecular Biology"},{"key":"2023020209510127600_B19","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1126\/science.274.5288.765","article-title":"Nested retrotransposons in the intergenic regions of the maize genome","volume":"274","author":"Sanmiguel","year":"1996","journal-title":"Science"},{"key":"2023020209510127600_B20","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/S0959-437X(99)00031-3","article-title":"Interspersed repeats and other mementos of transposable elements in mammalian genomes","volume":"9","author":"Smit","year":"1999","journal-title":"Curr. Opin. Gene. Dev"},{"key":"2023020209510127600_B21","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1111\/j.1574-6968.1999.tb13575.x","article-title":"BLAST 2 Sequences, A New Tool for Comparing Protein and Nucleotide Sequences","volume":"177","author":"Tatusova","year":"1999","journal-title":"FEMS Microbiol. Lett"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/24\/4\/468\/49045651\/bioinformatics_24_4_468.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/24\/4\/468\/49045651\/bioinformatics_24_4_468.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T10:39:00Z","timestamp":1675334340000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/24\/4\/468\/206621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,18]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,2,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btm613","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2008,2,15]]},"published":{"date-parts":[[2007,12,18]]}}}