PPI network comparison-oriented graph matching constraint solving symbol method
A PPI network and constraint solving technology, applied in the field of graph data and symbols, can solve problems such as combination complexity constraints, achieve the effect of reducing state space complexity and improving solution efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0042] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in combination with specific examples and with reference to the accompanying drawings.
[0043] The constraint satisfaction problem is a general solution paradigm for a large number of complex problems in the fields of artificial intelligence and computer science, with the goal of finding one or more assignments of variables that satisfy all constraints. So far, the research on the CSP algorithm has been extensive and in-depth, and there are many mature and effective algorithms. However, since the constraint satisfaction problem is usually NP-hard, it will inevitably be constrained by the combination complexity in the solution process. For Therefore, we introduce symbolic techniques.
[0044] Ordered Binary Decision Diagram (OBDD) and its extended form can realize the implicit representation and search of state ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com