Sciweavers

4 search results - page 1 / 1
» Discovering Frequent Poly-Regions in DNA Sequences
Sort
View
ICDM
2006
IEEE
135views Data Mining» more  ICDM 2006»
14 years 2 months ago
Discovering Frequent Poly-Regions in DNA Sequences
The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efficient approaches are propose...
Panagiotis Papapetrou, Gary Benson, George Kollios
CORR
2010
Springer
219views Education» more  CORR 2010»
13 years 8 months ago
Finding Sequential Patterns from Large Sequence Data
Data mining is the task of discovering interesting patterns from large amounts of data. There are many data mining tasks, such as classification, clustering, association rule mini...
Mahdi Esmaeili, Fazekas Gabor
COMAD
2008
13 years 10 months ago
REBMEC: Repeat Based Maximum Entropy Classifier for Biological Sequences
An important problem in biological data analysis is to predict the family of a newly discovered sequence like a protein or DNA sequence, using the collection of available sequence...
Pratibha Rani, Vikram Pudi
ALMOB
2006
138views more  ALMOB 2006»
13 years 8 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh