Uniqueness of Ancestor Genes

Part of the SpringerBriefs in Operations Research book series (BRIEFSOPERAT)


In Chap. 1 we stated the result that every graph has a unique complete family of ancestor genes. The result is proved in detail in this chapter. The proof is lengthy and is therefore broken up into several intermediate steps. We first show that it is sufficient to prove the result for graphs with no parthenogenic objects. We then consider all possible methods of decomposing a graph into three components via the inverse operations and show that the components so obtained are always the same regardless of the inverse operations used. Next we prove that any complete family of ancestor genes for a graph has cardinality which is a fixed constant for that graph. We then proceed to prove that for any descendant without parthenogenic objects, it is possible to isolate at least two genes with single inverse breeding operations. Finally, we use each of these results to prove the uniqueness theorem.


Ancestral Gene Complete Family Breeding Operations Inverse Operation Ancestral Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.School of CSEMFlinders UniversityBedford ParkAustralia

Personalised recommendations