Sciweavers

52 search results - page 6 / 11
» Reporting Exact and Approximate Regular Expression Matches
Sort
View
GPEM
2006
161views more  GPEM 2006»
13 years 7 months ago
Solving differential equations with genetic programming
A novel method for solving ordinary and partial differential equations, based on grammatical evolution is presented. The method forms generations of trial solutions expressed in an...
Ioannis G. Tsoulos, Isaac E. Lagaris
BMCBI
2006
153views more  BMCBI 2006»
13 years 7 months ago
The 3of5 web application for complex and comprehensive pattern matching in protein sequences
Background: The identification of patterns in biological sequences is a key challenge in genome analysis and in proteomics. Frequently such patterns are complex and highly variabl...
Markus Seiler, Alexander Mehrle, Annemarie Poustka...
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
14 years 8 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
QEST
2008
IEEE
14 years 1 months ago
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 26 days ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao