15 search results - page 3 / 3 » An Efficient Matching Algorithm for Encoded DNA Sequences an... |
CCECE
2006
IEEE
13 years 11 months ago
2006
IEEE
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...
MST
2006
13 years 5 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
BMCBI
2007
13 years 5 months ago
2007
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...
TCS
2008
13 years 5 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
BMCBI
2004
13 years 5 months ago
2004
Background: Mass spectrometry based proteomics result in huge amounts of data that has to be processed in real time in order to efficiently feed identification algorithms and to e...