The endpoint-endpoint distances of a tree were used together with the endpoint-branching point distances to reconstruct the underlying tree. The concept of triads and triangles (i.e. existing triads), composed of three endpoint-endpoint distances, was introduced. Each triangle defines a skeleton, that is a part of the underlying graph, and each skeleton defines a triangle uniquely. Several rules were derived, which can be used to eliminate irrelevant triads. A numerical example for a tree containing five endpoints has been worked out.
|Number of pages||3|
|Journal||Journal of Chemical Information and Computer Sciences|
|Publication status||Published - Mar 1 1994|
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics