234 search results - page 30 / 47 » A Simple Statistical Algorithm for Biological Sequence Compr... |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
BMCBI
2008
13 years 7 months ago
2008
Background: Occult organizational structures in DNA sequences may hold the key to understanding functional and evolutionary aspects of the DNA molecule. Such structures can also p...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
The prediction of the native structures of proteins, the socalled protein folding problem, is a NP hard multi-minima optimization problem for which to date no routine solutions ex...
COMPSEC
2004
13 years 7 months ago
2004
Abstract Up to now biometric methods have been used in cryptography for authentication purposes. In this paper we propose to use biological data for generating sequences of random ...
RECOMB
2003
Springer
14 years 8 months ago
2003
Springer
The availability of whole genome sequences and high-throughput genomic assays opens the door for in silico analysis of transcription regulation. This includes methods for discover...