Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

92

Voted

BIOCOMP
2008

84views Bioinformatics» more BIOCOMP 2008»

An Efficient Algorithm for the Longest Pattern Subsequence Problem

15 years 4 months ago

An Efficient Algorithm for the Longest Pattern Subsequence Problem

Download www.cc.gatech.edu

Xiaodong Wang, Lei Wang, Yingjie Wu

Real-time Traffic

BIOCOMP 2008 | Bioinformatics |

claim paper

Related Content

» Analysis of evolutionary algorithms for the longest common subsequence problem

» A New Efficient Algorithm for Computing the Longest Common Subsequence

» Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs

» Algorithms for computing variants of the longest common subsequence problem

» A Load Balancing Technique for Some CoarseGrained Multicomputer Algorithms

» CommunicationEfficient Private Protocols for Longest Common Subsequence

» All Semilocal Longest Common Subsequences in Subquadratic Time

» Semilocal longest common subsequences in subquadratic time

» Mining asynchronous periodic patterns in time series data

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	BIOCOMP
Authors	Xiaodong Wang, Lei Wang, Yingjie Wu

Comments (0)