- Autori:
-
Campagna, Davide; Romualdi, Chiara; Vitulo, Nicola; Del Favero, Micky; Lexa, Matej; Cannata, Nicola; Valle, Giorgio
- Titolo:
-
RAP: a new computer program for de novo identification of repeated sequences in whole genomes
- Anno:
-
2005
- Tipologia prodotto:
-
Articolo in Rivista
- Tipologia ANVUR:
- Articolo su rivista
- Lingua:
-
Inglese
- Referee:
-
No
- Nome rivista:
- BIOINFORMATICS
- ISSN Rivista:
- 1367-4803
- N° Volume:
-
21
- Numero o Fascicolo:
-
5
- Intervallo pagine:
-
582-588
- Parole chiave:
-
Algorithms; Animals; Caenorhabditis elegans; Chromosome Mapping; DNA; Pattern Recognition, Automated; Repetitive Sequences, Nucleic Acid; Sequence Alignment; Sequence Analysis, DNA; Software
- Breve descrizione dei contenuti:
- Motivation: DNA repeats are a common feature of most genomic sequences. Their de novo identification is still difficult despite being a crucial step in genomic analysis and oligonucleotides design. Several efficient algorithms based on word counting are available, but too short words decrease specificity while long words decrease sensitivity, particularly in degenerated repeats.Results: The Repeat Analysis Program (RAP) is based on a new word-counting algorithm optimized for high resolution repeat identification using gapped words. Many different overlapping gapped words can be counted at the same genomic position, thus producing a better signal than the single ungapped word. This results in better specificity both in terms of low-frequency detection, being able to identify sequences repeated only once, and highly divergent detection, producing a generally high score in most intron sequences.
- Id prodotto:
-
113384
- Handle IRIS:
-
11562/1013410
- ultima modifica:
-
12 novembre 2022
- Citazione bibliografica:
-
Campagna, Davide; Romualdi, Chiara; Vitulo, Nicola; Del Favero, Micky; Lexa, Matej; Cannata, Nicola; Valle, Giorgio,
RAP: a new computer program for de novo identification of repeated sequences in whole genomes
«BIOINFORMATICS»
, vol.
21
, n.
5
,
2005
,
pp. 582-588
Consulta la scheda completa presente nel
repository istituzionale della Ricerca di Ateneo 
