Sciweavers

621 search results - page 50 / 125
» DNA Computing in Microreactors
Sort
View
CDB
2004
Springer
172views Database» more  CDB 2004»
14 years 1 months ago
Constraint Database Solutions to the Genome Map Assembly Problem
Abstract. Long DNA sequences have to be cut using restriction enzymes into small fragments whose lengths and/or nucleotide sequences can be analyzed by currently available technolo...
Viswanathan Ramanathan, Peter Z. Revesz
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
14 years 2 days ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
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...
M. Sohel Rahman, Costas S. Iliopoulos
GECCO
2000
Springer
123views Optimization» more  GECCO 2000»
13 years 11 months ago
Genomic computing: explanatory modelling for functional genomics
Many newly discovered genes are of unknown function. DNA microarrays are a method for determining the expression levels of all genes in an organism for which a complete genome seq...
Richard J. Gilbert, Jem J. Rowland, Douglas B. Kel...
CCECE
2006
IEEE
14 years 2 months ago
Survey of Biological High Performance Computing: Algorithms, Implementations and Outlook Research
During recent years there has been an explosive growth of biological data coming from genome projects, proteomics, protein structure determination, and the rapid expansion in digi...
Nasreddine Hireche, J. M. Pierre Langlois, Gabriel...
BMCBI
2007
168views more  BMCBI 2007»
13 years 8 months ago
GOSim - an R-package for computation of information theoretic GO similarities between terms and gene products
Background: With the increased availability of high throughput data, such as DNA microarray data, researchers are capable of producing large amounts of biological data. During the...
Holger Fröhlich, Nora Speer, Annemarie Poustk...