Article
Identification of polymorphic motifs using probabilistic search algorithms.
Genome research - 1 Jan 2005
Basu Analabha, Chaudhuri Probal, Majumder Partha P
Abstract excerpt
The problem of identifying motifs comprising nucleotides at a set of polymorphic DNA sites, not necessarily contiguous, arises in many human genetic problems. However, when the sites are not contiguous, no efficient algorithm exists for polymorphic motif identification. A search based on complete enumeration is computationally inefficient. We have developed probabilistic search algorithms to discover motifs of...
Read the complete abstract on PubMedTopics
Share this publication in a Topic to start or enrich a Post.