Sciweavers

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

101

Voted

IPL
2007

99views more IPL 2007»

Dynamic programming algorithms for the mosaic longest common subsequence problem

15 years 2 months ago

Dynamic programming algorithms for the mosaic longest common subsequence problem

Download par.cse.nsysu.edu.tw

Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yu

Real-time Traffic

IPL 2007 |

claim paper

Related Content

» A genetic algorithm for the longest common subsequence problem

» Algorithms for computing variants of the longest common subsequence problem

» Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings

» All Common Subsequences

» A Load Balancing Technique for Some CoarseGrained Multicomputer Algorithms

» Restricted LCS

» Parameterized Computation of LCS for Two Sequences

» CacheOblivious Dynamic Programming for Bioinformatics

» Theoretical Framework for Eliminating Redundancy in Workflows

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	IPL
Authors	Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yung-Hsing Peng, Hsing-Yen Ann

Comments (0)