Related Experiment Videos
The art of pedigree drawing: algorithmic aspects
1GIS Infobiogen, 7 rue Guy Môquet, BP 8, 94801 Villejuif cedex Généthon, 1 bis rue de l'Internationale, 91000 Evry, France.
Bioinformatics (Oxford, England)
|March 10, 2001
Summary
Representing complex pedigrees with loops and multiple relationships is challenging. This study connects pedigree representation to the interval graph sandwich problem, offering a new drawing algorithm.
Area of Science:
- Computational Biology
- Graph Theory
- Genetics
Background:
- Pedigree representation is complex due to consanguinity loops, multiple partners, and related families.
- Standard methods struggle to provide clear visualizations for intricate family structures.
Purpose of the Study:
- To establish a clear mathematical framework for representing complex pedigrees.
- To develop an efficient algorithm for drawing complex pedigrees.
Main Methods:
- Equating the problem of meaningful pedigree representation to the interval graph sandwich problem.
- Developing and proposing a novel algorithm for pedigree drawing.
Main Results:
- Demonstrated the equivalence between finding a meaningful pedigree representation and solving the interval graph sandwich problem.
- Presented a new algorithm capable of drawing complex pedigrees.
Conclusions:
- The interval graph sandwich problem provides a powerful tool for understanding pedigree representation.
- The proposed algorithm offers a solution for visualizing complex family structures effectively.