150 related articles for article (PubMed ID: 22897201)
1. Comparing pedigree graphs.
Kirkpatrick B; Reshef Y; Finucane H; Jiang H; Zhu B; Karp RM
J Comput Biol; 2012 Sep; 19(9):998-1014. PubMed ID: 22897201
[TBL] [Abstract][Full Text] [Related]
2. Algorithms for Pedigree Comparison.
Chen ZZ; Feng Q; Shen C; Wang J; Wang L
IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):422-431. PubMed ID: 27076461
[TBL] [Abstract][Full Text] [Related]
3. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
Guturu P; Dantu R
IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
[TBL] [Abstract][Full Text] [Related]
4. An efficient algorithm for haplotype inference on pedigrees with recombinations and mutations.
Pirola Y; Bonizzoni P; Jiang T
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(1):12-25. PubMed ID: 21383417
[TBL] [Abstract][Full Text] [Related]
5. Comparing Unlabeled Pedigree Graphs via Covering with Bipartite and Path.
Amar LA; Belal NA; Rashwan S
J Comput Biol; 2016 Nov; 23(11):912-922. PubMed ID: 27442905
[TBL] [Abstract][Full Text] [Related]
6. Isomorphism and similarity for 2-generation pedigrees.
Jiang H; Lin G; Tong W; Zhu D; Zhu B
BMC Bioinformatics; 2015; 16 Suppl 5(Suppl 5):S7. PubMed ID: 25860335
[TBL] [Abstract][Full Text] [Related]
7. A binary linear programming formulation of the graph edit distance.
Justice D; Hero A
IEEE Trans Pattern Anal Mach Intell; 2006 Aug; 28(8):1200-14. PubMed ID: 16886857
[TBL] [Abstract][Full Text] [Related]
8. IPED: inheritance path-based pedigree reconstruction algorithm using genotype data.
He D; Wang Z; Han B; Parida L; Eskin E
J Comput Biol; 2013 Oct; 20(10):780-91. PubMed ID: 24093229
[TBL] [Abstract][Full Text] [Related]
9. IPED2: Inheritance Path Based Pedigree Reconstruction Algorithm for Complicated Pedigrees.
He D; Wang Z; Parida L; Eskin E
IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(5):1094-1103. PubMed ID: 28368828
[TBL] [Abstract][Full Text] [Related]
10. Computing the minimum recombinant haplotype configuration from incomplete genotype data on a pedigree by integer linear programming.
Li J; Jiang T
J Comput Biol; 2005; 12(6):719-39. PubMed ID: 16108713
[TBL] [Abstract][Full Text] [Related]
11. Reconstructing pedigrees: a stochastic perspective.
Thatte BD; Steel M
J Theor Biol; 2008 Apr; 251(3):440-9. PubMed ID: 18249415
[TBL] [Abstract][Full Text] [Related]
12. IPED2X: a robust pedigree reconstruction algorithm for complicated pedigrees.
He D; Eskin E
J Bioinform Comput Biol; 2014 Dec; 12(6):1442007. PubMed ID: 25553812
[TBL] [Abstract][Full Text] [Related]
13. Pedigree reconstruction using identity by descent.
Kirkpatrick B; Li SC; Karp RM; Halperin E
J Comput Biol; 2011 Nov; 18(11):1481-93. PubMed ID: 22035331
[TBL] [Abstract][Full Text] [Related]
14. HAPLORE: a program for haplotype reconstruction in general pedigrees without recombination.
Zhang K; Sun F; Zhao H
Bioinformatics; 2005 Jan; 21(1):90-103. PubMed ID: 15231536
[TBL] [Abstract][Full Text] [Related]
15. A (sub)graph isomorphism algorithm for matching large graphs.
Cordella LP; Foggia P; Sansone C; Vento M
IEEE Trans Pattern Anal Mach Intell; 2004 Oct; 26(10):1367-72. PubMed ID: 15641723
[TBL] [Abstract][Full Text] [Related]
16. Designing an A* algorithm for calculating edit distance between rooted-unordered trees.
Horesh Y; Mehr R; Unger R
J Comput Biol; 2006; 13(6):1165-76. PubMed ID: 16901235
[TBL] [Abstract][Full Text] [Related]
17. A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree.
Lai EY; Wang WB; Jiang T; Wu KP
BMC Bioinformatics; 2012; 13 Suppl 17(Suppl 17):S19. PubMed ID: 23281626
[TBL] [Abstract][Full Text] [Related]
18. Selecting loop breakers in general pedigrees.
Vitezica ZG; Mongeau M; Manfredi E; Elsen JM
Hum Hered; 2004; 57(1):1-9. PubMed ID: 15133307
[TBL] [Abstract][Full Text] [Related]
19. A deterministic annealing algorithm for approximating a solution of the min-bisection problem.
Dang C; Ma W; Liang J
Neural Netw; 2009 Jan; 22(1):58-66. PubMed ID: 18995985
[TBL] [Abstract][Full Text] [Related]
20. Partition-distance via the assignment problem.
Konovalov DA; Litow B; Bajema N
Bioinformatics; 2005 May; 21(10):2463-8. PubMed ID: 15746275
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
