Inspiration

We chose to solve challenge 2 because we saw that it was a do-able goal. Additionally, the binary sorting method works, Riley, was able to do it by hand which means it's easier to do with computers. And we wanted to improve patient care and disease detection methods

What it does

Our software aims to compare data to other family trees and find links from there. While the binary sorting algorithm is in it's early stages, we hope to further develop the algorithm.

How I built it

We use a binary tree algorithm to compare different families. By taking trees and dividing them into smaller sub-trees, we are able to compare and confirm similarities between these families. The program generates a margin of error then displays the resulting familial tree that is generated.

Challenges I ran into

Optimizing the layout of DOT graphs for family history purposes, and allowing the data to be readable. Interpreting the relations given in data files and turning them into family trees. We also ran into the issue of compressing our ideas and work into a 2-minute video presentation. Our team member also got sick and was unavailable for the majority of day 2.

Accomplishments that I'm proud of

We are proud that we were able to overcome our challenges. We are very proud of Riley, for going through the effort of drawing all 20 families into trees by hand.

What I learned

We learned all the advantages and disadvantages of the DOT system for generating graphs. We also learned how to codify diseases using medical ontology methodology.

What's next for The Missing Links

Sleep, Phil E. will continue his research, Phil B. will return to work. The remaining members will return to school and are anxiously awaiting mid-term grades. If we are to continue this research we hope to further develop the binary sorting algorithm.

Built With

Share this project:

Updates