Sciweavers

43 search results - page 2 / 9
» A Dynamic Programming Approach for Finding Common Patterns i...
Sort
View
ALMOB
2006
138views more  ALMOB 2006»
13 years 4 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
BMCBI
2010
112views more  BMCBI 2010»
13 years 5 months ago
A parameter-adaptive dynamic programming approach for inferring cophylogenies
Background: Coevolutionary systems like hosts and their parasites are commonly used model systems for evolutionary studies. Inferring the coevolutionary history based on given phy...
Daniel Merkle, Martin Middendorf, Nicolas Wieseke
TSE
2008
91views more  TSE 2008»
13 years 4 months ago
Privately Finding Specifications
Buggy software is a reality and automated techniques for discovering bugs are highly desirable. A specification describes the correct behavior of a program. For example, a file mus...
Westley Weimer, Nina Mishra
BIOCOMP
2006
13 years 6 months ago
Parameterized Computation of LCS for Two Sequences
- The problem of finding the longest common subsequence is a well-known optimization problem because of its applications, especially in bioinformatics. In this paper, by applying t...
Yuan Lin, Jeff Jenness, Xiuzhen Huang
IWPC
2006
IEEE
13 years 10 months ago
Dynamic Analysis of Software Systems using Execution Pattern Mining
Software system analysis for extracting system functionality remains as a major problem in the reverse engineering literature and the early approaches mainly rely on static proper...
Hossein Safyallah, Kamran Sartipi