Sciweavers

3320 search results - page 499 / 664
» Heuristics for the Phylogeny Problem
Sort
View
IJBRA
2007
80views more  IJBRA 2007»
13 years 9 months ago
On predicting secondary structure transition
A function of a protein is dependent on its structure; therefore, predicting a protein structure from an amino acid sequence is an active area of research. Optimally predicting a ...
Raja Loganantharaj, Vivek Philip
IJPP
2007
56views more  IJPP 2007»
13 years 9 months ago
Fault-aware Communication Mapping for NoCs with Guaranteed Latency
As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival prob...
Sorin Manolache, Petru Eles, Zebo Peng
TCBB
2008
103views more  TCBB 2008»
13 years 9 months ago
DNA Motif Representation with Nucleotide Dependency
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
Francis Y. L. Chin, Henry C. M. Leung
TDP
2008
160views more  TDP 2008»
13 years 9 months ago
Enhanced P-Sensitive K-Anonymity Models for Privacy Preserving Data Publishing
Publishing data for analysis from a micro data table containing sensitive attributes, while maintaining individual privacy, is a problem of increasing significance today. The k-ano...
Xiaoxun Sun, Hua Wang, Jiuyong Li, Traian Marius T...
TON
2008
125views more  TON 2008»
13 years 9 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni