Finding Ultraconserved Elements in Genomes
Author Information
Author(s): Christley Scott, Lobo Neil F, Madey Greg
Primary Institution: University of Notre Dame
Hypothesis
The algorithm can efficiently identify ultraconserved elements across multiple genomes without requiring genome alignment.
Conclusion
The algorithm demonstrates that whole genome comparative analysis for multiple organisms is feasible and efficient.
Supporting Evidence
- The algorithm found 123 ultraconserved elements longer than 40 bps shared by 17 vertebrate genomes.
- It identified 920,000 ultraconserved sequences in the human body louse genome.
- The algorithm outperformed existing tools like BLAST in terms of speed and memory efficiency.
Takeaway
The study created a computer program that can quickly find important DNA sequences shared by many animals, helping scientists understand their functions.
Methodology
The algorithm uses a combinatorial approach to find ultraconserved sequences without requiring genome alignment, processing data in parallel on computer clusters.
Limitations
The algorithm's efficiency may be limited by the physical memory available on the computing hardware.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website