The art of pedigree drawing: algorithmic aspects
Frédéric Torès, Emmanuel Barillot · Bioinformatics · 2001
Abstract Motivation: Giving a meaningful representation of a pedigree is not obvious when it includes consanguinity loops, individuals with multiple mates or several related families. Results: We show that finding a perfectly meaningful representation of a pedigree is equivalent to the interval graph sandwich problem and we propose an algorithm for drawing pedigrees. Contact: [email protected] * To whom correspondence should be addressed.