Skip to main content
. 2010 Feb 24;10:11. doi: 10.1186/1472-6947-10-11

Figure 1.

Figure 1

The tree structure of PROMED with '1 to n' problem histories. Each box represents one database record for a problem event. Problem 1 has two events; problem 2 has 5 events, etc. The history of each problem starts with a black box and ends with a red; the blue are intermediate events.