Algorithms for comparing large pedigree graphs
The importance of pedigrees is translated by geneticists as a tool for diagnosing genetic diseases. Errors resulting during collection of data and missing information of individuals are considered obstacles in deducing pedigrees, especially larger ones. Therefore, the reconstructed pedigree graph ev...
Main Authors: | Nahla A. Belal, Lamiaa A. Amar, Hany H. Sherief |
---|---|
Format: | Article |
Language: | English |
Published: |
Academy Publishing Center
2022-06-01
|
Series: | Advances in Computing and Engineering |
Subjects: | |
Online Access: | http://apc.aast.edu/ojs/index.php/ACE/article/view/474 |
Similar Items
-
An efficient algorithm for graph isomorphism /
by: 420680 Corneil, D. G., et al. -
A Zero Knowledge Authentication Protocol Based on Novel Heuristic Algorithm of Dense Induced Subgraphs Isomorphism
by: N. M. G. Al-Saidi, et al.
Published: (2015-01-01) -
Polynomial Time Algorithms for Variants of Graph Matching on Partial k-Trees
by: Nagoya Takayuki
Published: (2016-09-01) -
An Efficient Subgraph Isomorphism Solver for Large Graphs
by: Zubair Ali Ansari, et al.
Published: (2021-01-01) -
A family of tractable graph metrics
by: José Bento, et al.
Published: (2019-11-01)