Sciweavers

224 search results - page 7 / 45
» The Complexity of Phrase Alignment Problems
Sort
View
MM
2004
ACM
106views Multimedia» more  MM 2004»
14 years 4 months ago
Phrase structure detection in dance
This paper deals with phrase structure detection in contemporary western dance. Phrases are a sequence of movements that exist at semantic abstraction than gestures. The problem i...
Vidyarani M. Dyaberi, Hari Sundaram, Jodi James, G...
JACM
2000
119views more  JACM 2000»
13 years 10 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
BMCBI
2005
158views more  BMCBI 2005»
13 years 11 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 11 months ago
On the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
Shmuel Friedland
HICSS
2003
IEEE
90views Biometrics» more  HICSS 2003»
14 years 4 months ago
A Prototype for Multiple Whole Genome Alignment
In this paper, we briefly describe a prototype of the software system we have developed for multiple whole genome alignment. To develop our algorithm, we have to solve several pr...
Jitender S. Deogun, Fangrui Ma, Jingyi Yang, Andre...