inria-00100088, version 1
Computer analysis of multiple repeats in bacteria
The fourth International Conference on Bioinformatics of Genome Regulation and Structure - BGRS'2004 (2004) 5 p
Abstract: Motivation: The presence of repeated sequences is a well-known feature of bacterial genomes and interpretation and classification of those repeats is an actual problem. Results: We described a method for computing multiple repeats, that is sequences that have multiple (two or more) occurrences in a genome. In order to identify multiple repeats in bacteria genomes, we apply the YASS software (Noe et Kucherov) and developed a novel algorithm for multiple repeat clusterization. Exhaustive computation and analysis of those clusters of repeated sequences in bacteria is the subject of the present work.
- a – INRIA
- b – UNIVERSITE HENRI POINCARE
- 1:
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- Domain : Computer Science/Other
- Keywords : repeats – clusterization – bacteria || répétitions – groupement – bactéries
- Internal note : A04-R-332 || vitreschak04b
- Comment : Colloque avec actes et comité de lecture. internationale.
- inria-00100088, version 1
- http://hal.inria.fr/inria-00100088
- oai:hal.inria.fr:inria-00100088
- From:
- Submitted on: Tuesday, 26 September 2006 10:14:00
- Updated on: Thursday, 28 September 2006 15:22:47


Export