Sciweavers

1732 search results - page 73 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
SPIRE
2009
Springer
15 years 11 months ago
Faster Algorithms for Sampling and Counting Biological Sequences
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 ...
Christina Boucher
ICML
1999
IEEE
16 years 7 months ago
Detecting Motifs from Sequences
The problemofmultipleglobalcomparisonin familiesof biologicalsequences has been wellstudied. Fewer algorithms have been developed for identifying local consensus patterns or motif...
Yuh-Jyh Hu, Suzanne B. Sandmeyer, Dennis F. Kibler
RSA
2002
99views more  RSA 2002»
15 years 6 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott
CMMR
2008
Springer
152views Music» more  CMMR 2008»
15 years 8 months ago
Labelling the Structural Parts of a Music Piece with Markov Models
Abstract. This paper describes a method for labelling structural parts of a musical piece. Existing methods for the analysis of piece structure often name the parts with musically ...
Jouni Paulus, Anssi Klapuri
FSTTCS
2000
Springer
15 years 10 months ago
On-Line Edge-Coloring with a Fixed Number of Colors
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
Lene M. Favrholdt, Morten N. Nielsen