Genetic linkage analysis algorithms and their implementation

Authors:
Anna Ingolfsdottir;Daniel Gudbjartsson
Affiliations:
DeCode Genetics, Reykjavik, Iceland;DeCode Genetics, Reykjavik, Iceland
Venue:
Transactions on Computational Systems Biology III
Year:
2005

Citing 4
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Spectral transforms for large boolean functions with applications to technology mapping

DAC '93 Proceedings of the 30th international Design Automation Conference
Algebric Decision Diagrams and Their Applications

Formal Methods in System Design
The complexity of checking consistency of pedigree information and related problems

Journal of Computer Science and Technology - Special issue on bioinformatics

An accurate method for inferring relatedness in large datasets of unphased genotypes via an embedded likelihood-ratio test

RECOMB'13 Proceedings of the 17th international conference on Research in Computational Molecular Biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linkage analysis is a well established method for studying the relationship between the pattern of the occurrence of a given biological trait such as a disease and the inheritance pattern of certain genes in a given family. In this paper we give some improved algorithms for the genetic linkage analysis. In particular we offer an MTBDD based version of these algorithms that turns out to be a considerable improvement of the existing ones both in terms of time and space efficiency. The paper also contains a formal mathematical or computational description of the linkage analysis that gives a deeper insight into the area and therefore a better understanding of the related problems and how to solve them.