Chromeister
Chromeister performs ultra-fast heuristic pairwise genome comparisons to detect conserved fragments and synteny blocks amid repetitive DNA in large genomes such as those of mammals and plants.
Key Features:
- Heuristic Algorithm: Employs a heuristic algorithm tailored to separate conserved fragments from noise and repeats in pairwise genome comparisons.
- Efficiency and Speed: Executes computations in linear time using a minimum of one core to enable rapid processing of very long genomic sequences.
- Minimal Resource Demand: Operates with a small, constant memory footprint to reduce computational resource requirements.
- Previsualization and Indexing: Produces a previsualization of genomic comparisons and a collection of indices to reduce the complexity of exhaustive comparisons.
- Automated Classification and Synteny Block Detection: Scores genome comparisons to automate sequence classification and generates a list of detected synteny blocks.
Scientific Applications:
- Evolutionary biology: Identification of conserved regions and synteny blocks to inform studies of evolutionary relationships.
- Comparative genomics: Pairwise comparison of large genomes to detect conservation and structural correspondence between genomes.
- Functional genomics: Detection of conserved genomic segments to support investigations into the functional significance of genomic regions.
Methodology:
Uses heuristic techniques with linear-time computation and a small constant memory footprint, includes indexing and previsualization of comparisons, and applies scoring to classify sequences and list detected synteny blocks.
Topics
Details
- License:
- GPL-3.0
- Programming Languages:
- C, R, Python
- Added:
- 8/2/2022
- Last Updated:
- 11/24/2024
Operations
Publications
Pérez-Wohlfeil E, Diaz-del-Pino S, Trelles O. Ultra-fast genome comparison for large-scale genomic experiments. Scientific Reports. 2019;9(1). doi:10.1038/s41598-019-46773-w. PMID:31312019. PMCID:PMC6635410.