Versions of the invention are directed to computer-based methods, apparatus and software (programs) for fast, dynamic programming and recursive partitioning techniques to segment data, especially real-world data, into data structures for display as nodal trees. These techniques and displayed data in segmented form have numerous applications, especially for the analysis and understanding of real-world data. Some particular applications are in the area of computational high throughput screening of molecular drug (or pharmaceutical) candidates using a quantitative structure activity relationship (QSAR) approach. Another particular application is in the areas of pharmacogenomics and pharmacogenetics.
The present patent application claims priority from U.S. provisional patent application 60/225,113, filed 14 Aug. 2000 and all of the contents 60/225,113 are incorporated herein by reference and to the fullest extent of the law. The present application is a CIP of PCT/US01/25519 (having the same title) filed 14 Aug. 2001 and PCT/US01/25519 is incorporated herein by reference in its entirety and to the fullest extent of the law. The present application claims priority from U.S. provisional patent application 60/358,631 filed 20 Feb. 2002 and all of the contents 60/358,631 are incorporated herein by reference and to the fullest extent of the law.
