161 search results - page 2 / 33 » Efficient Algorithms for Handling Molecular Weighted Sequenc... |
DNA
2004
Springer
14 years 1 months ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
ICCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. There are several computer programs that align mRNA with its genomic counterpart to determine exon boundaries. Though most of these programs perform such alignment effici...
GIS
2006
ACM
14 years 8 months ago
2006
ACM
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...
AAIM
2007
Springer
13 years 11 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...
BMCBI
2002
13 years 7 months ago
2002
Background: The identification of species or species groups with specific oligo-nucleotides as molecular signatures is becoming increasingly popular for bacterial samples. However...