The art of pedigree drawing: Algorithmic aspects

13Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Tores, F., & Barillot, E. (2001). The art of pedigree drawing: Algorithmic aspects. Bioinformatics, 17(2), 174–179. https://doi.org/10.1093/bioinformatics/17.2.174

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free