It is often impossible to sequence all descendent genomes to reconstruct an ancestral genome. In addition, more genomes do not necessarily give a higher accuracy for the reconstruction of ancestral character states. These facts lead to studying the genome selection for reconstruction problem. In this work, two greedy algorithms for this problem are proposed and tested on computer simulation data as well as a biological example.