The interpretation of large-scale protein network data depends on our ability to identify significant substructures in the data, a computationally intensive task. Here we adapt and extend efficient techniques for finding paths and trees in graphs to the problem of identifying pathways in protein interaction networks. We present linear-time algorithms for finding paths and trees in networks under several biologically motivated constraints. We apply our methodology to search for protein pathways in the yeast protein-protein interaction network. We demonstrate that our algorithm is capable of reconstructing known signaling pathways and identifying functionally enriched paths and trees in an unsupervised manner. The algorithm is very efficient, computing optimal paths of length 8 within minutes and paths of length 10 in about three hours.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1089/cmb.2006.13.133 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Improved RRT* Path-Planning Algorithm Based on the Clothoid Curve for a Mobile Robot Under Kinematic Constraints.
Sensors (Basel)
December 2024
College of Computer and Information Science, Southwest University, Chongqing 400715, China.
In this paper, we propose an algorithm based on the Rapidly-exploring Random Trees* (RRT*) algorithm for the path planning of mobile robots under kinematic constraints, aiming to generate efficient and smooth paths quickly. Compared to other algorithms, the main contributions of our proposed algorithm are as follows: First, we introduce a bidirectional expansion strategy that quickly identifies a direct path to the goal point in a short time. Second, a node reconnection strategy is used to eliminate unnecessary nodes, thereby reducing the path length and saving memory.
View Article and Find Full Text PDFPath Planning for Multiple Targets for Cannula Flexible Needle With Variable-Curvature Trajectories.
Int J Med Robot
December 2024
Key Laboratory of Advanced Manufacturing and Intelligent Technology, Ministry of Education, Harbin University of Science and Technology, Harbin, China.
Background: Saturated biopsy is widely used in a histopathological examination of prostate biopsy surgery by expanding the target regions and the increasing the number of insertions.
Methods: The paper proposed a path planning algorithm for multiple targets with a single entry for a cannula flexible needle with variable curvatures. The algorithm is based on modified rapidly-exploring random trees (RRTs), and the variable-curvature motions of the flexible needle are used to achieve optimal path.
Route Planning Process by the Endangered Black Lion Tamarin in Different Environmental Contexts.
Am J Primatol
January 2025
Laboratório de Primatologia (LaP), Departamento de Biodiversidade, Instituto de Biociências, Universidade Estadual Paulista (UNESP), Rio Claro, Brazil.
Daily, primates take a variety of decisions to establish why, when, and where to move. However, little is known about the factors influencing and shaping primate daily routes. We investigated the decision-making processes linked to route planning in four groups of black lion tamarins (BLT-Leontopithecus chrysopygus).
View Article and Find Full Text PDFA UAV path planning method based on the framework of multi-objective jellyfish search algorithm.
Sci Rep
November 2024
Yunnan Key Laboratory of Unmanned Autonomous System, Yunnan Minzu University, Kunming, 650504, China.
Multi-constraint UAV path planning problems can be viewed as many-objective optimization problems that can be solved by meta-heuristic algorithms with good self-organizing optimization capabilities. However, such algorithms mostly use random initializing methods, resulting in low-quality initial paths that reduce the efficiency of subsequent algorithmic searches. Moreover, as the number of objective functions increases, meta-heuristic algorithms face inadequate selection pressure and convergence capability, which lead to poor solution.
View Article and Find Full Text PDFMoving ecological tree-ring big data forwards: Limitations, data integration, and multidisciplinarity.
Sci Total Environ
December 2024
Plant Ecology, Institute of Integrative Biology, D-USYS, ETH Zürich, Zürich, Switzerland; Biology Dpt., University of Washington, Seattle, USA.
In recent years, tree-ring databases have emerged as a remarkable resource for ecological research, allowing us to address ecological questions at unprecedented temporal and spatial scales. However, concerns regarding big tree-ring data limitations and risks have also surfaced, leading to questions about their potential to be representative of long-term forest responses. Here, we highlight three paths of action to improve on tree-ring databases in ecology: 1) Implementing consistent bias analyses in large dendroecological databases and promoting community-driven data to address data limitations, 2) Encouraging the integration of tree-ring data with other ecological datasets, and 3) Promoting theory-driven, mechanistic dendroecological research.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!