2877 search results - page 150 / 576 » Computational Biology |
144
click to vote
AAIM
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
120
click to vote
JPDC
2006
15 years 4 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
126
click to vote
AHS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, key features of biological vs. artificial systems are identified, along with a synopsis of important consequences of those features. An artificial substrate that co...
237
click to vote
CPM
2004
Springer
15 years 9 months ago
2004
Springer
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...
111
click to vote
RECOMB
2001
Springer
16 years 4 months ago
2001
Springer
Protein-protein interactions play a central role in many cellular functions, and as whole-genome data accumulates, computational methods for predicting these interactions become i...