Sciweavers

621 search results - page 73 / 125
» DNA Computing
Sort
View
145
Voted
ISMB
1993
15 years 3 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
109
Voted
CANDC
2000
ACM
15 years 2 months ago
Sequence Complexity for Biological Sequence Analysis
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
Lloyd Allison, Linda Stern, Timothy Edgoose, Trevo...
103
Voted
DCC
2007
IEEE
16 years 1 months ago
A Simple Statistical Algorithm for Biological Sequence Compression
This paper introduces a novel algorithm for biological sequence compression that makes use of both statistical properties and repetition within sequences. A panel of experts is ma...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison, Chris ...
107
Voted
RECOMB
2001
Springer
16 years 2 months ago
Applications of generalized pair hidden Markov models to alignment and gene finding problems
Hidden Markov models (HMMs) have been successfully applied to a variety of problems in molecular biology, ranging from alignment problems to gene nding and annotation. Alignment p...
Lior Pachter, Marina Alexandersson, Simon Cawley
98
Voted
DCC
2007
IEEE
16 years 1 months ago
Structure induction by lossless graph compression
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
Leonid Peshkin