Sciweavers

1191 search results - page 19 / 239
» A new approach to nonrepetitive sequences
Sort
View
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
13 years 11 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...
ACIVS
2005
Springer
14 years 1 months ago
A New Voting Algorithm for Tracking Human Grasping Gestures
Abstract. This article deals with a monocular vision system for grasping gesture acquisition. This system could be used for medical diagnostic, robot or game control. We describe a...
Pablo Negri, Xavier Clady, Maurice Milgram
JCB
2007
106views more  JCB 2007»
13 years 7 months ago
Clustered Sequence Representation for Fast Homology Search
We present a novel approach to managing redundancy in sequence databanks such as GenBank. We store clusters of near-identical sequences as a representative union-sequence and a se...
Michael Cameron, Yaniv Bernstein, Hugh E. Williams
DAC
1996
ACM
13 years 12 months ago
A New Hybrid Methodology for Power Estimation
1 In this paper, we propose a hybrid approach for estimating the switching activities of the internal nodes in logic circuits. The new approach combines the advantages of the simul...
David Ihsin Cheng, Kwang-Ting Cheng, Deborah C. Wa...
PPSN
2004
Springer
14 years 1 months ago
An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem
Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
Gabriele Koller, Günther R. Raidl