In the context of our work on phylogenetic reconstruction, we show how an 
evolutionary tree defines a sandwich family of threshold graphs which are 
triangulated. In order to improve incorrect data, we define an edge 
composition scheme which computes a triangulation of each graph by removing
edges instead of classically adding them. We discuss the extension of this
concept to weakly triangulated graphs, a popular superclass of triangulated
graphs.