Optimizing exact genetic linkage computations

Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB

Volumn , Issue , 2003, Pages 114-121

  Fishelson, Ma'ayan ^a   Geiger, Dan ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Bayesian networks; Combinatorial Optimization; DAG Models; Genetic Linkage Analysis; Greedy Algorithms; Probabilistic Algorithms; SUPERLINK; Treewidth

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DISEASES; GENES; RANDOM PROCESSES;

GENETIC LINKAGE ANALYSIS;

GENETIC ENGINEERING;

EID: 0038715348     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/640075.640089     Document Type: Conference Paper

References (29)

1. S. K. Andersen, K. G. Olesen, F. V. Jensen, and F. Jensen. HUGIN - a shell for building Bayesian belief universes for expert systems. In Proc. of the 11th International Joint Conference on Artificial Intelligence (IJCAI), volume 2, pages 1080-1085, 1989.
2. S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposibility. BIT, 25:2-23, 1985.
3. S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth., 8:277-284, 1987.
4. A. Becker and D. Geiger. A sufficiently fast algorithm for finding close to optimal clique trees. Artificial Intelligence, 125(1-2):3-17, 2001.
5. A. Becker, D. Geiger, and A. A. Schäffer. Automatic selection of loop breakers for genetic linkage analysis. Hum. Hered., 48(1):4960, 1998.
6. H. Bodlaender, A. Koster, F. Eijkhof, and L. Gaag. Pre-processing for triangulation of probabilistic networks. In Proc. 17th Conf. on Uncertainty in Artificial Intelligence (UAI), pages 32-39, 2001.
7. R. W. J. Cottingham, R. M. Idury, and A. A. Schäffer. Faster sequential genetic linkage computations. Am. J. Hum. Genet., 53:252-263, 1993.
8. R. Dechter. Topological parameters for time-space tradeoff. In Proc. Twelfth Conference on Uncertainty in Artificial Intelligence (UAI), pages 220-227, 1996.
9. R. Dechter. Bucket elimination: A unifying framework for probabilistic inference. In J. M. I. (Ed.), editor, learning in Graphical Models, pages 75-104. Kluwer Academic Press., 1998.
10. R. C. Elston and J. Stewart. A general model for the analysis of pedigree data. Hum. Hered., 21:523-542, 1971.
11. M. Fishelson and D. Geiger. Exact genetic linkage computations for general pedigrees. Bioinformatics, 18(Suppl. 1):S189-S198, 2002.
12. N. Friedman, D. Geiger, and N. Lotner. Likelihood computation with value abstraction. In Proc. Sixteenth Conf. on Uncertainty in Artificial Intelligence (UAI), pages 192-200, 2000.
13. Hugin. The API reference manual version 5.4. February 2002.
14. U. Kjærulff. Triangulation of graph - algorithms giving small total state space. Technical Report R90-09, Department of Computer Science, Aalborg University, Denmark, March 1990.
15. A. Koster, H. Bodlaender, and S. Hoesel. Treewidth: Computational experiments. Technical Report ZIB 01-38, December 2001.
16. L. Kruglyak, M. J. Daly, and E. S. Lander. Rapid multipoint linkage analysis of recessive traits in nuclear families including homozygosity mapping. Am. J. Hum. Genet., 56:519-527, 1995.
17. L. Kruglyak, M. J. Daly, M. P. Reeve-Daly, and E. S. Lander. Parametric and nonparametric linkage analysis: A unified multipoint approach. Am. J. Hum. Genet., 58(6):1347-1363, 1996.
18. E. S. Lander and P. Green. Construction of multilocus genetic maps in humans. In Proc. Natl. Acad. Sci., volume 84, pages 2363-2367, 1987.
19. J. Larrosa. Boosting search with variable elimination. In Proc. 6th International Conf. on Principles and Practice of Constraint Programming (CP2000), pages 291-305, September 2000.
20. S. L. Lauritzen. Graphical Models. Oxford University Press., 1996.
21. J. R. O'Connell. Rapid multipoint linkage analysis via inheritance vectors in the Elston-Stewart algorithm. Hum. Hered., 51(4):226-240, 2001.
22. J. R. O'connell and D. E. Weeks. The VITESSE algorithm for rapid exact multilocus linkage analysis via genotype set-recoding and fuzzy inheritance. Nat. Genet., 11:402-408, 1995.
23. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Francisco, CA, 1988.
24. I. Rish and R. Dechter. Resolution versus search: Two strategies for SAT. Journal of Automated Reasoning, 24(1-2):225-275, January 2000.
25. D. Rose, E. Tarjan, and G. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5:266-283, 1976.
26. A. A. Schäffer, S. K. Gupta, K. Shriram, and R. W. J. Cottingham. Avoiding recomputation in linkage analysis. Hum. Hered., 44:225-237, 1994.
27. R. D. Shachter, S. K. Andersen, and P. Szolovits. Global conditioning for probabilistic inference in belief networks. In Proc. Tenth Conf. on Uncertainty in Artificial Intelligence (UAI), pages 514-522, 1994.
28. K. Shoikhet and D. Geiger. A practical algorithm for finding optimal triangulations. In Proc. 14th National Conf. on Artificial Intelligence (AAAI), pages 185-190, July 1997.
29. R. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13(3):566-579, 1984.