Sciweavers

267 search results - page 8 / 54
» Sequence Comparisons via Algorithmic Mutual Information
Sort
View
BMCBI
2010
143views more  BMCBI 2010»
14 years 7 months ago
A genome alignment algorithm based on compression
Background: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of th...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison
SPIRE
2005
Springer
15 years 3 months ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger
DICTA
2003
14 years 11 months ago
Automatic Adaptive Segmentation of Moving Objects Based on Spatio-Temporal Information
This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We for...
Ofer Miller, Amir Averbuch, Yosi Keller
ICML
2008
IEEE
15 years 10 months ago
Multi-classification by categorical features via clustering
We derive a generalization bound for multiclassification schemes based on grid clustering in categorical parameter product spaces. Grid clustering partitions the parameter space i...
Yevgeny Seldin, Naftali Tishby

Publication
173views
13 years 8 months ago
Max-Flow Segmentation of the Left Ventricle by Recovering Subject-Specific Distributions via a Bound of the Bhattacharyya Measur
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two or...
Ismail Ben Ayed, Hua-mei Chen, Kumaradevan Punitha...