Sciweavers

3356 search results - page 55 / 672
» Determining Consensus Numbers
Sort
View
DAM
2007
81views more  DAM 2007»
13 years 8 months ago
Graphs, partitions and Fibonacci numbers
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
Arnold Knopfmacher, Robert F. Tichy, Stephan Wagne...
BMCBI
2004
117views more  BMCBI 2004»
13 years 8 months ago
CisOrtho: A program pipeline for genome-wide identification of transcription factor target genes using phylogenetic footprinting
Background: All known genomes code for a large number of transcription factors. It is important to develop methods that will reveal how these transcription factors act on a genome...
Henry R. Bigelow, Adam S. Wenick, Allan Wong, Oliv...
GCB
2003
Springer
105views Biometrics» more  GCB 2003»
14 years 2 months ago
In silico prediction of UTR repeats using clustered EST data
Clustering of EST data is a method for the non-redundant representation of an organisms transcriptome. During clustering of large amounts of EST data, usually some large clusters ...
Stefan A. Rensing, Daniel Lang, Ralf Reski
WIMOB
2007
IEEE
14 years 3 months ago
The Analysis of the Optimal Periodic Ranging Slot Number in IEEE 802.16 OFDMA Systems
As part of the IEEE 802.16 protocol, the random access scheme is used for ranging. The ratio between the numbers of periodic ranging slots and data slots in the uplink subframe de...
Jihua Zhou, Xin Jin, Jiangtao Dong, Jinglin Shi, Z...
DM
2010
117views more  DM 2010»
13 years 9 months ago
The distinguishing chromatic number of Cartesian products of two complete graphs
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
Janja Jerebic, Sandi Klavzar