Sciweavers

8 search results - page 1 / 2
» Finding relevant patterns in bursty sequences
Sort
View
PVLDB
2008
107views more  PVLDB 2008»
13 years 4 months ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald
BMCBI
2008
110views more  BMCBI 2008»
13 years 5 months ago
Determining significance of pairwise co-occurrences of events in bursty sequences
Background: Event sequences where different types of events often occur close together arise, e.g., when studying potential transcription factor binding sites (TFBS, events) of ce...
Niina Haiminen, Heikki Mannila, Evimaria Terzi
BMCBI
2008
108views more  BMCBI 2008»
13 years 5 months ago
An analysis of the positional distribution of DNA motifs in promoter regions and its biological relevance
Background: Motif finding algorithms have developed in their ability to use computationally efficient methods to detect patterns in biological sequences. However the posterior cla...
Ana C. Casimiro, Susana Vinga, Ana T. Freitas, Arl...
ISMB
1994
13 years 6 months ago
Optimally Parsing a Sequence into Different Classes Based on Multiple Types of Evidence
Weconsider the problem of parsing a sequence into different classes of subsequences.Twocommonexamplesare finding the exons and introns in genomicsequences and identifying the seco...
Gary D. Stormo, David Haussler
ALMOB
2006
80views more  ALMOB 2006»
13 years 5 months ago
Pattern statistics on Markov chains and sensitivity to parameter estimation
Background: In order to compute pattern statistics in computational biology a Markov model is commonly used to take into account the sequence composition. Usually its parameter mu...
Grégory Nuel