Sciweavers

CPM
2007
Springer
99views Combinatorics» more  CPM 2007»
14 years 5 months ago
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
14 years 5 months ago
Improved Sketching of Hamming Distance with Error Correcting
We address the problem of sketching the hamming distance of data streams. We present a new notion of sketching technique, Fixable sketches and we show that using such sketch not o...
Ely Porat, Ohad Lipsky
CPM
2007
Springer
88views Combinatorics» more  CPM 2007»
14 years 5 months ago
A New and Faster Method of Sorting by Transpositions
Maxime Benoît-Gagné, Sylvie Hamel
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
14 years 5 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield