Modeling biological systems

• US 20030033126A1
• Filed: 05/15/2001
• Published: 02/13/2003
• Est. Priority Date: 05/10/2001
• Status: Abandoned Application

• Current Assignee: SRI International, Inc.
• Original Assignee: SRI International, Inc.
• Inventors: Knapp, A. Merrill, Laderoute, Keith Richard, Lincoln, Patrick Denis
• Application Number:
  US09/855,458
• Publication Number:
  US 20030033126A1
• Time in Patent Office: Days
• US Class Current: 703/11
• CPC Class Codes: G16B 45/00 ICT specially adapted for bioinformatics-related data visualisation, e.g. displaying of maps or networks
• CPC Class Codes: G16B 5/00 ICT specially adapted for modelling or simulations in systems biology, e.g. gene-regulatory networks, protein interaction networks or metabolic networks
• CPC Class Codes: G16B 5/10 Boolean models

Abstract

Biological systems are modeled using formal languages and theorem provers and model checkers and term rewriting systems. The models include rules that express a substitution of at least one symbol by at least another symbol. The symbols represent elements of the biological system, and the rules are expressed in a manner that, for example, enables an inference engine to infer alternative results from the system based on an initial hypothetical state.

Inference engines are also applied to symbolically simulate, test properties, and explore the biological system. Abstractions and algorithms can be employed to enable symbolic calculation of state sets for the biological system.

Claims

1. A method comprising:

generating a model of a biological system, the model comprising rules that express a substitution of at least one symbol by at least another symbol, the symbols representing a biological element, and at least some of the rules being expressed in a manner that enables an inference engine to infer alternative results from the system based on an initial hypothetical state.

2. The method of claim 1 wherein one or more of the rules comprises an operator for expressing a relationship between at least two of the biological elements, the operator conforming to associative and commutative properties.

3. The method of claim 1 wherein one or more of the miles expresses concurrent state transitions.

4. The method of claim 1 wherein at least some of the rules are not terminating.

5. The method of claim 1 wherein at least one of the rules represents a feedback or feedforward interaction between biological elements.

6. The method of claim 1 wherein one or more of the rules is reflective.

7. The method of claim 1 wherein one or more of the symbols representing the biological elements is typed.

8. The method of claim 7 wherein the types of symbols are organized in hierarchical classes.

9. The method of claim 8 wherein a symbol for one of the hierarchical classes is matched by any symbol that is a member of the hierarchical class.

10. The method of claim 1 wherein at least some of the rules are conditional.

11. The method of claim 1, further comprising expressing the rules graphically by representing at least some of the symbols as points and at least some of rules as lines interconnecting points, each interconnected point corresponding to a symbol that is an operand of the rule.

12. The method of claim 1 wherein one or more of the symbols represents a polypeptide selected from the group consisting of a protein kinase, a transcription factor, a cytokine, and a nucleotide binding protein.

13. The method of claim 1 wherein one or more of the symbols represents a polypeptide selected from the group consisting of pRB, cyclins, cyclin-dependent kinases, cyclin-dependent kinase inhibitors, p53, E2F, and DP1.

14. The method of claim 1 wherein one or more of the symbols represents a drug or exogenous agent.

15. The method of claim 1 wherein one or more of the symbols represents post-translational modification.

16. The method of claim 1 wherein the model of the biological system includes a first set of symbols representing molecules in a first cell and a second set of symbols representing molecules in a second cell.

17. The method of claim 16 wherein one or more of the first set of symbols comprises the same symbols of the second set.

18. An article comprising machine-readable media having encoded thereon a model of a biological system, the model comprising rules that express a substitution of at least one symbol by at least another symbol, the symbols representing a biological element, and at least one of the rules being expressed in a manner that enables an inference engine to infer alternative results from the system based on an initial hypothetical state.

19. The article of claim 18 wherein one or more of the rules comprises an operator for expressing a relationship between at least two of the biological elements, the operator conforming to associative and commutative properties.

20. The article of claim 18 wherein one or more of the rules expresses concurrent state transitions.

21. The article of claim 18 wherein at least some of the rules are not terminating.

22. The article of claim 18 wherein at least one of the rules represents a feedback or feedforward interaction between biological elements.

23. The article of claim 18 wherein one or more of the rules is reflective.

24. The article of claim 18 wherein one or more of the symbols representing the biological elements is typed.

25. The article of claim 24 wherein the types of symbols are organized in hierarchical classes.

26. The article of claim 25 wherein a symbol for one of the hierarchical classes is matched by any symbol that is a member of the hierarchical class.

27. The article of claim 18 wherein at least some of the rules are conditional.

28. The article of claim 18 wherein one or more of the symbols represents a polypeptide selected from the group consisting of a protein kinase, a transcription factor, a cytokine, and a nucleotide binding protein.

29. The article of claim 18 wherein one or more of the symbols represents a polypeptide selected from the group consisting of pRB, cyclins, cyclin-dependent kinases, cyclin-dependent kinase inhibitors, p53, E2F, and DP1.

30. The article of claim 18 wherein one or more of the symbols represents a drug or exogenous agent.

31. The article of claim 18 wherein one or more of the symbols represents post-translational modification.

32. The article of claim 18 wherein the model of the biological system includes a first set of symbols representing molecules in a first cell and a second set of symbols representing molecules in a second cell.

33. The article of claim 32 wherein one or more of the first set of symbols comprises the same symbols of the second set.

34. A method comprising:

receiving a set of symbols in an inference engine, the set representing a hypothetical initial state of a biological system, the symbols representing elements of the biological system; and

processing the initial state using rules that express a substitution of at least one of the symbols by at least another symbol representing a biological element to infer alternative resultant states of the system.

35. The method of claim 34 wherein the set of symbols representing the hypothetical initial state is generated from an expression profile for a biological sample.

36. The method of claim 34, further comprising:

parsing a profile for a biological sample into symbols; and

include at least some of the symbols in the set of symbols representing a hypothetical initial state of the biological system.

37. The method of claim 36 wherein the profile is a gene expression profile.

38. The method of claim 36 wherein the profile is a polypeptide profile.

39. The method of claim 36 wherein the biological sample is associated with a disease or disorder.

40. The method of claim 39 wherein the disease or disorder is selected from the group consisting of cancer, diabetes, infection by a pathogen, inflammation, and a disease of aging.

41. The method of claim 34 wherein infinite substitution chains are detected.

42. The method of claim 34 wherein values of one or more of the symbols of the resultant states are displayed graphically as a wiring diagram.

43. The method of claim 42 wherein the wiring diagram comprises a graph having lines interconnecting points, each line corresponding to a rule such that each interconnected point of the line corresponds to a symbol that is an operand of the rule.

44. The method of claim 34, further comprising:

comparing each of the alternative resultant states to one or more reference states.

45. The method of claim 44 wherein the one or more reference states comprise a state associated with cell proliferation, cell quiescence, cell apoptosis, and cell differentiation.

46. The method of claim 44 wherein the alternative resultant states are compared to two or more reference states, each reference state being associated with a diagnosis.

47. The method of claim 44 wherein the hypothetical initial state represents a sample from a patient.

48. The method of claim 34 wherein the set of symbols representing hypothetical initial state comprises a symbol representing a genetic alteration.

49. The method of claim 44 wherein the one or more reference states comprise a state associated with a disease or disorder.

50. The method of claim 49 wherein the disease is selected from the group consisting of cancer, diabetes, infection by a pathogen, inflammation, and a disease of aging.

51. The method of claim 34 wherein one or more of the rules comprises an operator for expressing a relationship between at least two of the biological elements, the operator conforming to associative and commutative properties.

52. The method of claim 34 wherein one or more of the rules expresses concurrent state transitions.

53. The method of claim 34 wherein at least some of the rules are not terminating.

54. The method of claim 34 wherein at least one of the rules represents a feedback or feedforward interaction between biological elements.

55. The method of claim 34 wherein one or more of the rules is reflective.

56. The method of claim 34 wherein one or more of the symbols representing the biological elements is typed.

57. The method of claim 56 wherein the types of symbols are organized in hierarchical classes.

58. The method of claim 57 wherein a symbol for one of the hierarchical classes is matched by any symbol that is a member of the hierarchical class.

59. The method of claim 34 wherein at least some of the rules are conditional.

60. The method of claim 34 wherein one or more of the symbols represents a polypeptide selected from the group consisting of a protein kinase, a transcription factor, a cytokine, and a nucleotide binding protein.

61. The method of claim 34 wherein one or more of the symbols represents a polypeptide selected from the group consisting of pRB, cyclins, cyclin-dependent kinases, cyclin-dependent kinase inhibitors, p53, E2F, and DP1.

62. The method of claim 34 wherein one or more of the symbols represents a drug or exogenous agent.

63. The method of claim 34 wherein one or more of the symbols represents post-translational modification.

64. The method of claim 34 wherein the model of the biological system includes a first set of symbols representing molecules in a first cell and a second set of symbols representing molecules in a second cell.

65. The method of claim 64 wherein one or more of the first set of symbols comprises the same symbols of the second set.

66. A method comprising:

receiving a set of symbols in an inference engine, the set of symbols representing a hypothetical initial state of a biological system, the symbols representing biological elements of the system; and

iteratively substituting at least one of the symbols by at least another symbol representing a biological element using rules that represent interactions between the biological elements until a terminal state is detected or until alternative resultant states are detected.

67. The method of claim 66, further comprising outputting the terminal state or at least one of the alternative resultant states.

68. The method of claim 66 wherein the hypothetical initial state represents a biological sample from a patient.

69. The method of claim 68 wherein the biological sample is associated with a disease or disorder.

70. The method of claim 69 wherein the disease or disorder is selected from the group consisting of cancer, diabetes, infection by a pathogen, inflammation, and a disease of aging.

71. The method of claim 66, further comprising parsing a profile for a biological sample into symbols;

and include at least some of the symbols in the set of symbols representing a hypothetical initial state of the biological system.

72. The method of claim 66, further comprising:

comparing each of the alternative resultant states to one or more reference states.

73. The method of claim 72 wherein the one or more reference states comprise a state associated with cell proliferation, cell quiescence, cell apoptosis, and cell differentiation.

74. The method of claim 72 wherein the alternative resultant states are compared to two or more reference states, each reference state being associated with a diagnosis.

75. The method of claim 66 wherein the set of symbols representing hypothetical initial state comprises a symbol representing a genetic alteration.

76. The method of claim 66 wherein one or more of the symbols representing the biological elements is typed.

77. A method comprising:

receiving into an inference engine a rule set comprising rules that express a substitution of one or more of the symbols representing biological elements by at least another symbol representing a biological element; and

determining a property of the rule set.

78. The method of claim 77 wherein the property comprises an indicator of whether the rules set is terminating.

79. The method of claim 77 wherein the property comprises an indicator of whether the rule set includes one or more rules expressing a feedback or feedforward interaction.

80. The method of claim 77 wherein the determining comprises associative-commutative matching.

81. The method of claim 77 further comprising generating a decision diagram.

82. A method comprising:

receiving into an inference engine (1) at least a first and a second set of symbols wherein the first set of symbols represents a hypothetical first state of a biological system, and the second set of symbols represents a hypothetical second state of the biological system, and the symbols represent biological elements of the biological system, and (2) rules that express a substitution of one or more of the symbols representing biological elements by at least another symbol representing a biological element; and

determining if one or more of the rules must be true or false for the first state to reach the second state by processing the first state using the rules.

83. The method of claim 82 wherein the hypothetical first state represents a hypothetical reference sample, the hypothetical second state represents a sample associated with a disease or disorder, and a rule determined to be true identifies biological elements represented by its operands as drug targets.

84. The method of claim 82, further comprising

identifying a first profile for a first sample associated with the hypothetical first state of the biological system,

identifying a second profile for a second sample associated with the hypothetical second state of the biological system;

and

parsing the first and second profiles to produce the first and a second set of symbols.

85. The method of claim 84 wherein the first and second samples have one or more genetic alterations with respect to one another.

86. The method of claim 84 in which the first and second profiles include information about mRNA expression.

87. The method of claim 84 in which the first and second profiles include information about polypeptide abundance.

88. The method of claim 84 in which the first and second profiles include information about polypeptide modification.

89. The method of claim 84 in which the first and second profiles include information about metabolite abundance.

90. The method of claim 82 in which one or more of the rules expresses concurrent state transitions.

91. The method of claim 82 in which at least some of the rules are not terminating.

92. The method of claim 82 in which at least one of the rules represents a feedback or feedforward interaction between biological elements.

93. The method of claim 82 in which at least one or more of the symbols representing the biological elements is typed.

94. The method of claim 93 in which the types of symbols are organized in hierarchical classes.

95. The method of claim 82 wherein the hypothetical first state represents a hypothetical reference sample, the hypothetical second state represents a sample contacted with a drug or exogenous agent, and a rule determined to be true identifies biological elements represented by its operands as drug targets.

96. An article comprising machine-readable media having encoded thereon software configured to cause the processor to:

receive a set of symbols, the set representing a hypothetical initial state of a biological system, the symbols representing biological elements of the system; and

iteratively substitute one or more of the symbols representing biological elements by at least another symbol representing a biological element using rules that represent interactions between the biological elements until a terminal state or until alternative resultant states are detected.

97. The article of claim 96 wherein one or more of the rules comprises an operator for expressing a relationship between at least two of the biological elements, the operator conforming to associative and commutative properties.

98. The article of claim 96 wherein one or more of the rules expresses concurrent state transitions.

99. The article of claim 96 wherein at least some of the rules are not terminating.

100. The article of claim 96 wherein at least one of the rules represents a feedback or feedforward interaction between biological elements.

101. The article of claim 96 wherein one or more of the rules is reflective.

102. The article of claim 96 wherein one or more of the symbols representing the biological elements is typed.

103. The article of claim 102 wherein the types of symbols are organized in hierarchical classes.

104. The article of claim 103 wherein a symbol for one of the hierarchical classes is matched by any symbol that is a member of the hierarchical class.

105. The article of claim 96 wherein the software is further to cause the processor to:

receive a second set of symbols for a hypothetical second state of the biological system; and

compare the second set of symbols to the terminal state or to at least one of the alternative resultant states.

106. An article comprising machine-readable media having encoded thereon software configured to cause the processor to:

receive information for a first state of a biological system;

generate symbols representing biological elements of the system; and

iteratively substitute one or more of the symbols representing biological elements by at least another symbol representing a biological element using rules that represent interactions between the biological elements until a terminal state or until alternative resultant states are detected.

107. The article of claim 106 wherein one or more of the symbols representing the biological elements is typed.

108. The article of claim 106 wherein the information comprises values, each value reflecting the abundance of a biological element in the first state.

109. The article of claim 108 wherein generating comprises comparing each value to a threshold parameter for the value, and generating a symbol for the biological element whose abundance is reflected by the value if the value exceeds the threshold parameter.