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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 204; s. 38 - 48
Hlavní autori:	Cygan, M., Kubica, M., Radoszewski, J., Rytter, W., Waleń, T.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 11.05.2016
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!