scholarly journals Detecting genetic association through shortest paths in a bidirected graph

2017 ◽  
Vol 41 (6) ◽  
pp. 481-497 ◽  
Author(s):  
Masao Ueki ◽  
Yoshinori Kawasaki ◽  
Gen Tamiya ◽  
Keyword(s):  
Genetic Association ◽  
Shortest Paths ◽  
Bidirected Graph

Genetic association study in schizophrenia and intermediate phenotypes

2009 ◽  
Vol 42 (05) ◽  
Author(s):  
M Boxleitner ◽  
I Giegling ◽  
AM Hartmann ◽  
J Genius ◽  
A Ruppert ◽  
...  
Keyword(s):  
Association Study ◽  
Genetic Association ◽  
Genetic Association Study ◽  
Intermediate Phenotypes

eMap: A Web Application for Identifying and Visualizing Electron or Hole Hopping Pathways in Proteins

2019 ◽  
Author(s):  
Ruslan N. Tazhigulov ◽  
James R. Gayvert ◽  
Melissa Wei ◽  
Ksenia B. Bravaya
Keyword(s):  
Web Application ◽  
Shortest Paths ◽  
Coarse Grained ◽  
Decay Parameter ◽  
Electron Hole ◽  
Web Based ◽  
Aromatic Amino Acid Residue ◽  
Pathways Model ◽  
Visualization Tools ◽  
Effective Decay

<p>eMap is a web-based platform for identifying and visualizing electron or hole transfer pathways in proteins based on their crystal structures. The underlying model can be viewed as a coarse-grained version of the Pathways model, where each tunneling step between hopping sites represented by electron transfer active (ETA) moieties is described with one effective decay parameter that describes protein-mediated tunneling. ETA moieties include aromatic amino acid residue side chains and aromatic fragments of cofactors that are automatically detected, and, in addition, electron/hole residing sites that can be specified by the users. The software searches for the shortest paths connecting the user-specified electron/hole source to either all surface-exposed ETA residues or to the user-specified target. The identified pathways are ranked based on their length. The pathways are visualized in 2D as a graph, in which each node represents an ETA site, and in 3D using available protein visualization tools. Here, we present the capability and user interface of eMap 1.0, which is available at https://emap.bu.edu.</p>

Computer algorithms

2018 ◽  
Author(s):  
Mark Newman
Keyword(s):  
Data Structures ◽  
Analysis Of Algorithms ◽  
Shortest Paths ◽  
Minimum Cut ◽  
Network Data ◽  
Computer Algorithms ◽  
Breadth First Search ◽  
Augmenting Path ◽  
Basic Concepts ◽  
Maximum Flows

This chapter introduces some of the fundamental concepts of numerical network calculations. The chapter starts with a discussion of basic concepts of computational complexity and data structures for storing network data, then progresses to the description and analysis of algorithms for a range of network calculations: breadth-first search and its use for calculating shortest paths, shortest distances, components, closeness, and betweenness; Dijkstra's algorithm for shortest paths and distances on weighted networks; and the augmenting path algorithm for calculating maximum flows, minimum cut sets, and independent paths in networks.

scholarly journals Transcriptional and imaging-genetic association of cortical interneurons, brain function, and schizophrenia risk

2020 ◽  
Vol 11 (1) ◽  
Author(s):  
Kevin M. Anderson ◽  
Meghan A. Collins ◽  
Rowena Chin ◽  
Tian Ge ◽  
Monica D. Rosenberg ◽  
...  
Keyword(s):  
Genetic Association ◽  
Brain Function ◽  
Cortical Interneurons

scholarly journals Lower bounds for computing geometric spanners and approximate shortest paths

2001 ◽  
Vol 110 (2-3) ◽  
pp. 151-167 ◽  
Author(s):  
Danny Z. Chen ◽  
Gautam Das ◽  
Michiel Smid
Keyword(s):  
Lower Bounds ◽  
Shortest Paths ◽  
Geometric Spanners

Exploring the Genetic Association of the ABAT Gene with Alzheimer’s Disease

2021 ◽  
Author(s):  
Quanzhen Zheng ◽  
Rui Bi ◽  
Min Xu ◽  
Deng-Feng Zhang ◽  
Li-Wen Tan ◽  
...  
Keyword(s):  
Alzheimer’S Disease ◽  
Alzheimer's Disease ◽  
Genetic Association
Sign in / Sign up

Export Citation Format

Share Document