Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SPIRE

2009

Springer

2009

Springer

Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between pairwise bounded sets that have a consensus, and if so, ﬁnding one such sequence s∗ , and those that do not. This problem is closely related to the motif-recognition problem, stractly models ﬁnding important subsequences in biological data. We give an eﬃcient algorithm for sampling pairwise bounded sets, referred to as MarkovSampling, and show it generates pairwise bounded sets uniformly at random. We illustrate the applicability of MarkovSampling to eﬃciently solving motif-recognition instances. Computing the expected number of motif sets has been a long-standing open problem in motif-recognition [1, 3]. We consider the related problem of counting the number of pairwise bounded sets, give new bounds on number of pairwise bounded sets, and present an algorithmic approach to counting the number of pa...

Related Content

Added |
27 Jul 2010 |

Updated |
27 Jul 2010 |

Type |
Conference |

Year |
2009 |

Where |
SPIRE |

Authors |
Christina Boucher |

Comments (0)