Linked Life Data

12603053

Source:http://linkedlifedata.com/resource/pubmed/id/12603053

Statements in which the resource exists as a subject.
PredicateObject
rdf:type
lifeskim:mentions
pubmed:dateCreated
2003-2-26
pubmed:abstractText
We describe a new method for finding haplotype blocks based on the use of the minimum description length principle. We give a rigorous definition of the quality of a segmentation of a genomic region into blocks, and describe a dynamic programming algorithm for finding the optimal segmentation with respect to this measure. We also describe a method for finding the probability of a block boundary for each pair of adjacent markers: this gives a tool for evaluating the significance of each block boundary. We have applied the method to the published data of Daly et al. The results are in relatively good agreement with the published results, but also show clear differences in the predicted block boundaries and their strengths. We also give results on the block structure in population isolates.
pubmed:language
eng
pubmed:journal
pubmed:citationSubset
IM
pubmed:chemical
pubmed:status
MEDLINE
pubmed:issn
1793-5091
pubmed:author
pubmed:issnType
Print
pubmed:owner
NLM
pubmed:authorsComplete
Y
pubmed:pagination
502-13
pubmed:dateRevised
2007-9-12
pubmed:meshHeading
pubmed:year
2003
pubmed:articleTitle
An MDL method for finding haplotype blocks and for estimating the strength of haplotype block boundaries.
pubmed:affiliation
Department of Computer Science and HIIT Basic Research Unit, University of Helsinki, Helsinki, Finland.
pubmed:publicationType
Journal Article