Sciweavers

1607 search results - page 21 / 322
» The existence of k-radius sequences
Sort
View
CIKM
1998
Springer
13 years 12 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
DISOPT
2007
93views more  DISOPT 2007»
13 years 7 months ago
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...
RECOMB
2010
Springer
13 years 6 months ago
Consistency of Sequence-Based Gene Clusters
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
Roland Wittler, Jens Stoye
VLSID
2002
IEEE
106views VLSI» more  VLSID 2002»
14 years 8 months ago
SWASAD: An ASIC Design for High Speed DNA Sequence Matching
This paper presents the Smith and Waterman Algorithm-Specific ASIC Design (SWASAD) project. This is a hardware solution that implements the S&W algorithm.. The SWASAD is an imp...
Tony Han, Sri Parameswaran
ADMI
2009
Springer
14 years 2 months ago
A Sequence Mining Method to Predict the Bidding Strategy of Trading Agents
Abstract. In this work, we describe the process used in order to predict the bidding strategy of trading agents. This was done in the context of the Reverse TAC, or CAT, game of th...
Vivia Nikolaidou, Pericles A. Mitkas