The consensus string problem and the complexity of comparing hidden Markov models.
type: Item
instance of: scholarly article
title: The consensus string problem and the complexity of comparing hidden Markov models.
zbMATH Open document ID: 1059.68048
DOI: 10.1016/S0022-0000(02)00009-0
author: Rune B. Lyngsø
author: Christian Nørgaard Storm Pedersen
published in: Journal of Computer and System Sciences
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1910849
describes a project that uses: Pfam
MaRDI profile type: Publication
cites work: On the computational complexity of approximating distributions by probabilistic automata
cites work: Stochastic models for heterogeneous DNA sequences
cites work: Q3619797
cites work: Q4023085
cites work: Q2754129
cites work: Q4198056
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
description: scientific article; zbMATH DE number 1910849