-
Je něco špatně v tomto záznamu ?
RepeatExplorer: a Galaxy-based web server for genome-wide characterization of eukaryotic repetitive elements from next-generation sequence reads
P. Novák, P. Neumann, J. Pech, J. Steinhaisl, J. Macas,
Jazyk angličtina Země Anglie, Velká Británie
Typ dokumentu časopisecké články, práce podpořená grantem
NLK
Free Medical Journals
od 1996 do Před 1 rokem
PubMed Central
od 2007
Open Access Digital Library
od 1996-01-01
Medline Complete (EBSCOhost)
od 1998-01-01
Oxford Journals Open Access Collection
od 1985-01-01 do 2022-09-30
Oxford Journals Open Access Collection
od 1985-01-01
ROAD: Directory of Open Access Scholarly Resources
od 1998
- MeSH
- algoritmy MeSH
- DNA chemie MeSH
- Eukaryota genetika MeSH
- fylogeneze MeSH
- genom MeSH
- internet MeSH
- repetitivní sekvence nukleových kyselin * MeSH
- sekvenční analýza DNA * MeSH
- shluková analýza MeSH
- software * MeSH
- vysoce účinné nukleotidové sekvenování * MeSH
- Publikační typ
- časopisecké články MeSH
- práce podpořená grantem MeSH
MOTIVATION: Repetitive DNA makes up large portions of plant and animal nuclear genomes, yet it remains the least-characterized genome component in most species studied so far. Although the recent availability of high-throughput sequencing data provides necessary resources for in-depth investigation of genomic repeats, its utility is hampered by the lack of specialized bioinformatics tools and appropriate computational resources that would enable large-scale repeat analysis to be run by biologically oriented researchers. RESULTS: Here we present RepeatExplorer, a collection of software tools for characterization of repetitive elements, which is accessible via web interface. A key component of the server is the computational pipeline using a graph-based sequence clustering algorithm to facilitate de novo repeat identification without the need for reference databases of known elements. Because the algorithm uses short sequences randomly sampled from the genome as input, it is ideal for analyzing next-generation sequence reads. Additional tools are provided to aid in classification of identified repeats, investigate phylogenetic relationships of retroelements and perform comparative analysis of repeat composition between multiple species. The server allows to analyze several million sequence reads, which typically results in identification of most high and medium copy repeats in higher plant genomes.
Citace poskytuje Crossref.org
- 000
- 00000naa a2200000 a 4500
- 001
- bmc13031652
- 003
- CZ-PrNML
- 005
- 20131003100238.0
- 007
- ta
- 008
- 131002s2013 enk f 000 0|eng||
- 009
- AR
- 024 7_
- $a 10.1093/bioinformatics/btt054 $2 doi
- 035 __
- $a (PubMed)23376349
- 040 __
- $a ABA008 $b cze $d ABA008 $e AACR2
- 041 0_
- $a eng
- 044 __
- $a enk
- 100 1_
- $a Novák, Petr $u Institute of Plant Molecular Biology, Biology Centre ASCR, Branišovská 31, České Budějovice, CZ-37005, Czech Republic.
- 245 10
- $a RepeatExplorer: a Galaxy-based web server for genome-wide characterization of eukaryotic repetitive elements from next-generation sequence reads / $c P. Novák, P. Neumann, J. Pech, J. Steinhaisl, J. Macas,
- 520 9_
- $a MOTIVATION: Repetitive DNA makes up large portions of plant and animal nuclear genomes, yet it remains the least-characterized genome component in most species studied so far. Although the recent availability of high-throughput sequencing data provides necessary resources for in-depth investigation of genomic repeats, its utility is hampered by the lack of specialized bioinformatics tools and appropriate computational resources that would enable large-scale repeat analysis to be run by biologically oriented researchers. RESULTS: Here we present RepeatExplorer, a collection of software tools for characterization of repetitive elements, which is accessible via web interface. A key component of the server is the computational pipeline using a graph-based sequence clustering algorithm to facilitate de novo repeat identification without the need for reference databases of known elements. Because the algorithm uses short sequences randomly sampled from the genome as input, it is ideal for analyzing next-generation sequence reads. Additional tools are provided to aid in classification of identified repeats, investigate phylogenetic relationships of retroelements and perform comparative analysis of repeat composition between multiple species. The server allows to analyze several million sequence reads, which typically results in identification of most high and medium copy repeats in higher plant genomes.
- 650 _2
- $a algoritmy $7 D000465
- 650 _2
- $a shluková analýza $7 D016000
- 650 _2
- $a DNA $x chemie $7 D004247
- 650 _2
- $a Eukaryota $x genetika $7 D056890
- 650 _2
- $a genom $7 D016678
- 650 12
- $a vysoce účinné nukleotidové sekvenování $7 D059014
- 650 _2
- $a internet $7 D020407
- 650 _2
- $a fylogeneze $7 D010802
- 650 12
- $a repetitivní sekvence nukleových kyselin $7 D012091
- 650 12
- $a sekvenční analýza DNA $7 D017422
- 650 12
- $a software $7 D012984
- 655 _2
- $a časopisecké články $7 D016428
- 655 _2
- $a práce podpořená grantem $7 D013485
- 700 1_
- $a Neumann, Pavel $u -
- 700 1_
- $a Pech, Jiří $u -
- 700 1_
- $a Steinhaisl, Jaroslav $u -
- 700 1_
- $a Macas, Jiří $u -
- 773 0_
- $w MED00008115 $t Bioinformatics (Oxford, England) $x 1367-4811 $g Roč. 29, č. 6 (2013), s. 792-3
- 856 41
- $u https://pubmed.ncbi.nlm.nih.gov/23376349 $y Pubmed
- 910 __
- $a ABA008 $b sig $c sign $y a $z 0
- 990 __
- $a 20131002 $b ABA008
- 991 __
- $a 20131003100756 $b ABA008
- 999 __
- $a ok $b bmc $g 995739 $s 830097
- BAS __
- $a 3
- BAS __
- $a PreBMC
- BMC __
- $a 2013 $b 29 $c 6 $d 792-3 $i 1367-4811 $m Bioinformatics $n Bioinformatics $x MED00008115
- LZP __
- $a Pubmed-20131002