Sciweavers

34 search results - page 2 / 7
» The Computational Hardness of Estimating Edit Distance
Sort
View
DAM
2008
116views more  DAM 2008»
13 years 5 months ago
Expected number of breakpoints after t random reversals in genomes with duplicate genes
In comparative genomics, one wishes to deduce the evolutionary distance between dierent species by studying their genomes. Using gene order information, we seek the number of time...
Niklas Eriksen
MM
2005
ACM
139views Multimedia» more  MM 2005»
13 years 11 months ago
Exploiting self-adaptive posture-based focus estimation for lecture video editing
Head pose plays a special role in estimating a presenter’s focuses and actions for lecture video editing. This paper presents an efficient and robust head pose estimation algori...
Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong
ALMOB
2008
131views more  ALMOB 2008»
13 years 5 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
JEA
2008
97views more  JEA 2008»
13 years 5 months ago
Approximating the true evolutionary distance between two genomes
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome e...
Krister M. Swenson, Mark Marron, Joel V. Earnest-D...
SDM
2009
SIAM
223views Data Mining» more  SDM 2009»
14 years 2 months ago
Context Aware Trace Clustering: Towards Improving Process Mining Results.
Process Mining refers to the extraction of process models from event logs. Real-life processes tend to be less structured and more flexible. Traditional process mining algorithms...
R. P. Jagadeesh Chandra Bose, Wil M. P. van der Aa...