Polynomial-time approximation algorithms for weighted LCS problem

We consider a variant of the well-known Longest Common Subsequence (LCS) problem for weighted sequences. A weighted sequence determines the probability for each symbol to occur at a given position of the sequence (such sequences are also called Position Weighted Matrices, PWM). Two possible such ver...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 204; pp. 38 - 48
Main Authors:	Cygan, M., Kubica, M., Radoszewski, J., Rytter, W., Waleń, T.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 11.05.2016
Subjects:	Algorithms Alphabets Approximation Longest common subsequence Mathematical analysis Matrices (mathematics) Polynomial-time approximation scheme Pulse duration modulation Sequences Symbols Weighted sequence Polynomial-time approximation scheme Weighted sequence Longest common subsequence
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!