Structured Programming with go to Statements
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Family pedigree data as required by genetics has proven to be difficult to analyze. This paper presents a data collection and structuring technique developed for the program PDGRE, which significantly improves on past computer application performances and produces a binary tree representation for the data. Data is collected in family units, mother, father, and offspring. The units are related by linked lists of those individuals who appear in more than one unit. The algorithm TRANS translates the links from relative pointers to actual memory locations. TRANS also locates those individuals who will be root nodes for the binary tree representations of the pedigree data. Algorithm BUILD creates the binary tree for any root passed to it. Each binary tree represents a subset of the original data set. The subsets prove more suited to analysis than the entire pedigree. The number of subsets is determined by the number of roots located by TRANS. The end result is data represented by a well known data structure at a significantly lower cost than previous applications.