Sciweavers

2877 search results - page 149 / 576
» Biological Computing
Sort
View
JPDC
2006
134views more  JPDC 2006»
14 years 10 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
CPM
2004
Springer
156views Combinatorics» more  CPM 2004»
15 years 3 months ago
A Computational Model for RNA Multiple Structural Alignment.
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
Eugene Davydov, Serafim Batzoglou
ACSD
2008
IEEE
130views Hardware» more  ACSD 2008»
15 years 4 months ago
BAM: BioAmbient machine
In recent years it has become clear that techniques developed for concurrent programming are in fact very useful for the analysis of complex systems in biology. To some level of i...
Vinod A. Muganthan, Andrew Phillips, Maria Grazia ...
RECOMB
2004
Springer
15 years 10 months ago
Maximum likelihood resolution of multi-block genotypes
We present a new algorithm for the problems of genotype phasing and block partitioning. Our algorithm is based on a new stochastic model, and on the novel concept of probabilistic...
Gad Kimmel, Ron Shamir
ESWA
2006
148views more  ESWA 2006»
14 years 10 months ago
Applications of artificial intelligence in bioinformatics: A review
Artificial intelligence (AI) has increasingly gained attention in bioinformatics research and computational molecular biology. With the availability of different types of AI algor...
Zoheir Ezziane