Sciweavers

4137 search results - page 504 / 828
» On the number of matchings of a tree
Sort
View
BMCBI
2007
125views more  BMCBI 2007»
15 years 6 months ago
Identification of discriminative characteristics for clusters from biologic data with InforBIO software
Background: There are a number of different methods for generation of trees and algorithms for phylogenetic analysis in the study of bacterial taxonomy. Genotypic information, suc...
Naoto Tanaka, Masataka Uchino, Satoru Miyazaki, Hi...
157
Voted
CN
2007
116views more  CN 2007»
15 years 6 months ago
Scalability and security in biased many-to-one communication
In multicast communication, a source transmits the same content to a set of receivers. Current protocols for multicast follow a tree communication model which makes them scalable....
Francesc Sebé, Josep Domingo-Ferrer
JACM
2007
160views more  JACM 2007»
15 years 6 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
BMCBI
2004
125views more  BMCBI 2004»
15 years 6 months ago
A functional hierarchical organization of the protein sequence space
Background: It is a major challenge of computational biology to provide a comprehensive functional classification of all known proteins. Most existing methods seek recurrent patte...
Noam Kaplan, Moriah Friedlich, Menachem Fromer, Mi...
CORR
2004
Springer
177views Education» more  CORR 2004»
15 years 6 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard