Reconstructing Signaling Pathways Using Regular-Language Constrained Paths
Signaling pathways are widely studied in systems biology. Several databases catalog our knowledge of these pathways, including the proteins and interactions that comprise them. However, high-quality curation of this information is slow and painstaking. As a result, many interactions still lack annot...
Main Author: | Wagner, Mitchell James |
---|---|
Other Authors: | Computer Science |
Format: | Others |
Published: |
Virginia Tech
2018
|
Subjects: | |
Online Access: | http://hdl.handle.net/10919/85044 |
Similar Items
-
K Shortest Path Implementation
by: Nagubadi, RadhaKrishna
Published: (2013) -
Distributional Properties of Stochastic Shortest Paths for Smuggled Nuclear Material
by: Leticia Cuellar, et al.
Published: (2012-10-01) -
On the Maximal Shortest Paths Cover Number
by: Iztok Peterin, et al.
Published: (2021-07-01) -
An Algorithm for the Cycled Shortest Path Problem
by: Amir Salehipour, et al.
Published: (2011-07-01) -
A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation
by: Xianbiao Hu, PhD, et al.
Published: (2015-01-01)