• Talk at University of Waterloo, February 24, 2011: slides

• Talk at University of Waterloo, February 24, 2011: slides

HERD is a new decoding method for HMMs, developed for applications, where is difficult to predict annotation boundaries. Unlike traditional decoding methods (like Viterbi algorithm),

• Talk at University of Waterloo, February 24, 2011: slides

• Talk at University of Waterloo, 24 February 2011: slides

Articles, conferences, talks

• Talk at University of Waterloo: slides

HERD scores breakpoints individually to maximize the number of correctly predicted annotation boundaries. Currently our implementation work only on the problem

• CPM 2010: paper. Please cite this paper

• ECCB 2010: poster

HERD scores breakpoints individually to maximize the number of correctly predicted annotation boundaries. Currently our implementation work only one the problem

You can download our algorithm along with the source code. You can also read the manual page.

Articles, conferences

• CPM 2010: paper
• ECCB 2010: poster.

You can download our algorithm along with the source code. You can also read the manual page.

of viral recombination detection in HIV genome. In the section method are discussed algorithms used in HERD.

herd scores breakpoints individually to maximize the number of correctly predicted annotation boundaries. Currently our implementation work only one the problem of viral recombination detection in HIV genome.

You can download our algorithm along with the source code. You can also read the manual? page.

(:title Highest Expected Reward Decoding (HERD):)

HERD is a new decoding method for HMMs, developed for applications, where is difficult to predict annotation boundaries. Unlike traditional decoding methom (like Viterbi algorithm), herd scores breakpoints individually to maximize the number of correctly predicted annotation boundaries.

(:title Highest Expected Reward Decoding (HERD):)