Sciweavers

2192 search results - page 22 / 439
» Algorithms for Challenging Motif Problems
Sort
View
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
ISPDC
2005
IEEE
14 years 1 months ago
New Challenges in Parallel Optimization
: Optimization is a healthy field targeted to find efficient solutions and algorithms to solve problems either in the academia and the industry. As the solved problems became harde...
Enrique Alba
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
14 years 12 days ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
SCN
2004
Springer
121views Communications» more  SCN 2004»
14 years 1 months ago
ECRYPT: The Cryptographic Research Challenges for the Next Decade
Abstract. In the past thirty years, cryptology has evolved from a secret art to a modern science. Weaker algorithms and algorithms with short keys are disappearing, political contr...
Bart Preneel
BMCBI
2011
12 years 11 months ago
A mutation degree model for the identification of transcriptional regulatory elements
Background: Current approaches for identifying transcriptional regulatory elements are mainly via the combination of two properties, the evolutionary conservation and the overrepr...
Changqing Zhang, Jin Wang, Xu Hua, Jinggui Fang, H...