Structuration of phenotypes and genotypes through galois lattices and implications

The Galois Lattice of a binary relation formalizes it as a concept system, dually ordered in "extension"/"intension." All implications between conjunctions of properties holding in it are summarized by a canonical basis--all basis having the same cardinality. We report how these tools structure phenotypes/genotypes in behavior genetics. The first study on phenotypes of laterality has a unique set of features and two sets of instances (left-/right-handers) for which the corresponding sets of rules are compared, while the second study on partial trisomy 21 uses a unique instance set (patients) to explore the matching between two sets of features: phenotypes and genetic causes. Hence, both situations comprise two binary data sets that are paired through either a column or a row matching, which raises specific questions. If the data are small, as compared with databases in bioinformatics, this illustrates how these abstract tools can unfold better interpretations.

[1]  Henry Crapo,et al.  Selectors: A theory of formal languages, semimodular lattices, and branching and shelling processes☆ , 1984 .

[2]  Rudolf Wille.  Knowledge acquisition by methods of formal concept analysis , 1989 .

[3]  Bernard Monjardet,et al.  The lattices of Moore families and closure operators on a finite set: A survey , 1999, Electron. Notes Discret. Math..

[4]  M. Carlier,et al.  What Can Be Learned from a Lattice Analysis of a Laterality Questionnaire? , 2001, Behavior genetics.

[5]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[6]  Gyula O. H. Katona,et al.  The poset of closures as a model of changing databases , 1987 .

[7]  Vincent Duquenne,et al.  Latticial Structures in Data Analysis , 1999, Theor. Comput. Sci..

[8]  Rokia Missaoui,et al.  Learning algorithms using a Galois lattice structure , 1991, [Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91.

[9]  Vincent Duquenne,et al.  Familles minimales d'implications informatives résultant d'un tableau de données binaires , 1986 .

[10]  Vincent Duquenne,et al.  What can lattices do for experimental designs , 1986 .

[11]  Alan Day,et al.  The Lattice Theory of Functional Dependencies and Normal Decompositions , 1992, Int. J. Algebra Comput..

[12]  J. Delabar,et al.  Molecular Mapping of Twenty-Four Features of Down Syndrome on Chromosome 21 , 1993, European journal of human genetics : EJHG.

[13]  C. Disteche,et al.  Down syndrome phenotypes: the consequences of chromosomal imbalance. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[14]  ScienceDirect.  Electronic notes in discrete mathematics , 1999 .

[15]  Jean-Gabriel Ganascia.  TDIS : an Algebraic Formalization , 1993, IJCAI.

[16]  M. Wild.  A Theory of Finite Closure Spaces Based on Implications , 1994 .

[17]  C Chabert,et al.  Assessing Implications Between Genotypic and Phenotypic Variables Through Lattice Analysis , 2001, Behavior genetics.

[18]  A. Guénoche.  Construction du treillis de Galois d'une relation binaire , 1990 .

[19]  Vincent Duquenne.  The core of finite lattices , 1991, Discret. Math..

[20]  E. Diday,et al.  Data analysis, learning symbolic and numeric knowledge : proceedings of the conference on Data Analysis, Learning Symbolic and Numeric Knowledge, Antibes, September 11-14, 1989 , 1989 .

[21]  V. Duquenne.  Towards an intensional logic of symptoms , 1996 .