Sciweavers

4137 search results - page 249 / 828
» On the number of matchings of a tree
Sort
View
SPAA
2010
ACM
15 years 11 months ago
Delays induce an exponential memory gap for rendezvous in trees
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
Pierre Fraigniaud, Andrzej Pelc
BMCBI
2007
79views more  BMCBI 2007»
15 years 6 months ago
Orthology prediction at scalable resolution by phylogenetic tree analysis
Background: Orthology is one of the cornerstones of gene function prediction. Dividing the phylogenetic relations between genes into either orthologs or paralogs is however an ove...
René T. J. M. van der Heijden, Berend Snel,...
AVSS
2006
IEEE
16 years 23 days ago
Nonparametric Background Modeling Using the CONDENSATION Algorithm
Background modeling for dynamic scenes is an important problem in the context of real time video surveillance systems. Several nonparametric background models have been proposed t...
Xingzhi Luo, Suchendra M. Bhandarkar, Wei Hua, Hai...
IMSCCS
2006
IEEE
16 years 22 days ago
Clustering of Gene Expression Data: Performance and Similarity Analysis
Background: DNA Microarray technology is an innovative methodology in experimental molecular biology, which has produced huge amounts of valuable data in the profile of gene expre...
Longde Yin, Chun-Hsi Huang
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 11 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang