All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

RepeatExplorer: a Galaxy-based web server for genome-wide characterization of eukaryotic repetitive elements from next-generation sequence reads

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60077344%3A_____%2F13%3A00392350" target="_blank" >RIV/60077344:_____/13:00392350 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1093/bioinformatics/btt054" target="_blank" >http://dx.doi.org/10.1093/bioinformatics/btt054</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1093/bioinformatics/btt054" target="_blank" >10.1093/bioinformatics/btt054</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    RepeatExplorer: a Galaxy-based web server for genome-wide characterization of eukaryotic repetitive elements from next-generation sequence reads

  • Original language description

    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-basedsequence 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 an

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    EB - Genetics and molecular biology

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2013

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Bioinformatics

  • ISSN

    1367-4803

  • e-ISSN

  • Volume of the periodical

    29

  • Issue of the periodical within the volume

    6

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    2

  • Pages from-to

    792-793

  • UT code for WoS article

    000316270400017

  • EID of the result in the Scopus database