A minimal descriptor of an ancestral recombinations graph
2011

A Minimal Descriptor of Ancestral Recombination Graphs

publication Evidence: high

Author Information

Author(s): Parida Laxmi, Palamara Pier Francesco, Javed Asif

Primary Institution: IBM T J Watson Research, Columbia University

Hypothesis

Can a minimal descriptor of an ancestral recombination graph (ARG) be defined that preserves essential genetic characteristics?

Conclusion

The study successfully defines a minimal descriptor ARG that maintains the structure and genetic variation patterns of the original ARG.

Supporting Evidence

  • The minimal descriptor ARG preserves the structure of the original ARG.
  • Even unbounded ARGs can have a bounded minimal descriptor.
  • The expected reduction in the number of vertices in the minimal descriptor is exponential.

Takeaway

This study finds a way to simplify complex genetic graphs while keeping important information intact, making it easier to understand how genes evolve over time.

Methodology

The study uses graph-theoretic approaches to analyze ancestral recombination graphs and derive a minimal descriptor that preserves key properties.

Digital Object Identifier (DOI)

10.1186/1471-2105-12-S1-S6

Want to read the original?

Access the complete publication on the publisher's website

View Original Publication