𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The consensus string problem and the complexity of comparing hidden Markov models

✍ Scribed by Rune B. Lyngsø; Christian N.S. Pedersen


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
393 KB
Volume
65
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Stylized facts of daily return series an
✍ Tobias Rydén; Timo Teräsvirta; Stefan Åsbrink 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 487 KB

In two recent papers, Granger and Ding (1995a,b) considered long return series that are ®rst dierences of logarithmed price series or price indices. They established a set of temporal and distributional properties for such series and suggested that the returns are well characterized by the double ex

The time-dependent shortest pair of disj
✍ Sherali, Hanif D.; Ozbay, Kaan; Subramanian, Shivaram 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 3 views

In this paper, we examine complexity issues, models, and algorithms for the problem of finding a shortest pair of disjoint paths between two nodes of a network such that the total travel delay is minimized, given that the individual arc delays are time-dependent. Such disjoint paths address the issu

Delimiting subterritories of the human s
✍ Adam Zaidel; Alexander Spivak; Lavi Shpigelman; Hagai Bergman; Zvi Israel 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 626 KB

## Abstract Positive therapeutic response without adverse side effects to subthalamic nucleus deep brain stimulation (STN DBS) for Parkinson's disease (PD) depends to a large extent on electrode location within the STN. The sensorimotor region of the STN (seemingly the preferred location for STN DB