The way to infer well-supported phylogenetic trees that precisely reflect the
evolutionary process is a challenging task that completely depends on the way
the related core genes have been found. In previous computational biology
studies, many similarity based algorithms, mainly dependent on calculating
sequence alignment matrices, have been proposed to find them. In these kinds of
approaches, a significantly high similarity score between two coding sequences
extracted from a given annotation tool means that one has the same genes. In a
previous work article, we presented a quality test approach (QTA) that improves
the core genes quality by combining two annotation tools (namely NCBI, a
partially human-curated database, and DOGMA, an efficient annotation algorithm
for chloroplasts). This method takes the advantages from both sequence
similarity and gene features to guarantee that the core genome contains correct
and well-clustered coding sequences (\emph{i.e.}, genes). We then show in this
article how useful are such well-defined core genes for biomolecular
phylogenetic reconstructions, by investigating various subsets of core genes at
various family or genus levels, leading to subtrees with strong bootstraps that
are finally merged in a well-supported supertree.Comment: 12 pages, 7 figures, IWBBIO 2015 (3rd International Work-Conference
on Bioinformatics and Biomedical Engineering