Sciweavers

621 search results - page 47 / 125
» DNA Computing
Sort
View
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
14 years 2 months 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
CDB
2004
Springer
172views Database» more  CDB 2004»
14 years 3 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
ICASSP
2008
IEEE
14 years 4 months ago
Modeling regulatory sites with higher order position-dependent weight matrices
Identification of regulatory signals in DNA depends on the nature and quality of the patterns of representative sequences. These patterns are constructed from training sets of se...
Hossein Zare, Mostafa Kaveh, Arkady B. Khodursky
TCS
2008
13 years 10 months ago
Detection of subtle variations as consensus motifs
We address the problem of detecting consensus motifs, that occur with subtle variations, across multiple sequences. These are usually functional domains in DNA sequences such as t...
Matteo Comin, Laxmi Parida
NAR
2011
215views Computer Vision» more  NAR 2011»
13 years 1 months ago
dbCRID: a database of chromosomal rearrangements in human diseases
Chromosomal rearrangement (CR) events result from abnormal breaking and rejoining of the DNA molecules, or from crossing-over between repetitive DNA sequences, and they are involv...
Fanlou Kong, Jing Zhu, Jun Wu, Jianjian Peng, Ying...