Bioinformatics Vol. 17 no. 2 2001
Pages 174-179
© 2001 Oxford University Press
Original Paper |
The art of pedigree drawing: algorithmic aspects
1 GIS Infobiogen, 7 rue Guy
Môquet, BP 8, 94801 Villejuif cedex
2 Généthon,
1 bis rue de lInternationale, 91000
Évry, France
Received on July 13, 2000
; revised on September 7, 2000
; accepted on September 9, 2000
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: Emmanuel.Barillot{at}infobiogen.fr
* To whom correspondence should be addressed.
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
E. H. Trager, R. Khanna, A. Marrs, L. Siden, K. E.H. Branham, A. Swaroop, and J. E. Richards Madeline 2.0 PDE: a new program for local and web-based pedigree drawing Bioinformatics, July 15, 2007; 23(14): 1854 - 1856. [Abstract] [Full Text] [PDF] |
||||
![]() |
J. H. Zhao Pedigree-drawing with R and graphviz Bioinformatics, April 15, 2006; 22(8): 1013 - 1014. [Abstract] [Full Text] [PDF] |
||||
![]() |
Y. Yabuki, T. Muramatsu, T. Hirokawa, H. Mukai, and M. Suwa GRIFFIN: a system for predicting GPCR-G-protein coupling selectivity using a support vector machine and a hidden Markov model Nucleic Acids Res., July 1, 2005; 33(suppl_2): W148 - W153. [Abstract] [Full Text] [PDF] |
||||

