HERD.About History
Hide minor edits - Show changes to output
Changed line 15 from:
* Talk at University of Waterloo, February 24, 2011: [[http://ubuntuone.com/p/eom/|slides]]
to:
* Talk at University of Waterloo, February 24, 2011: [[http://ubuntuone.com/p/eon/|slides]]
Changed line 15 from:
* Talk at University of Waterloo, February 24, 2011: slides
to:
* Talk at University of Waterloo, February 24, 2011: [[http://ubuntuone.com/p/eom/|slides]]
Changed line 5 from:
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),
to:
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),
Changed line 15 from:
* Talk at University of Waterloo, 24 February 2011: slides
to:
* Talk at University of Waterloo, February 24, 2011: slides
Changed line 15 from:
* Talk at University of Waterloo: slides
to:
* Talk at University of Waterloo, 24 February 2011: slides
Changed lines 11-12 from:
to:
!!Articles, conferences, talks
Added line 15:
* Talk at University of Waterloo: slides
Changed line 6 from:
HERD scores breakpoints individually to maximize the number of correctly predicted annotation boundaries. Currently our implementation work only one the problem
to:
HERD scores breakpoints individually to maximize the number of correctly predicted annotation boundaries. Currently our implementation work only on the problem
Changed line 13 from:
*CPM 2010: [[http://compbio.fmph.uniba.sk/papers/expanded.php?paper=2010004|paper]]
to:
*CPM 2010: [[http://compbio.fmph.uniba.sk/papers/expanded.php?paper=2010004|paper]]. Please cite this paper
Changed line 14 from:
*ECCB 2010: [[Attach:HERD/eccb-poster.pdf|poster]].
to:
*ECCB 2010: [[Attach:HERD/eccb-poster.pdf|poster]]
Added lines 3-4:
%rfloat%[[Attach:HERD/eccb-poster.pdf|Attach:HERD/eccb-poster-small.jpg]]
Changed line 6 from:
herd scores breakpoints individually to maximize the number of correctly predicted annotation boundaries. Currently our implementation work only one the problem
to:
HERD scores breakpoints individually to maximize the number of correctly predicted annotation boundaries. Currently our implementation work only one the problem
Changed lines 9-16 from:
You can [[HERD/Download|download]] our algorithm along with the source code. You can also read the [[HERD/Usage|manual]] page.
to:
You can [[HERD/Download|download]] our algorithm along with the source code. You can also read the [[HERD/Usage|manual]] page.
!!Articles, conferences
*CPM 2010: [[http://compbio.fmph.uniba.sk/papers/expanded.php?paper=2010004|paper]]
*ECCB 2010: [[Attach:HERD/eccb-poster.pdf|poster]].
Changed line 7 from:
You can [[HERD/Download|download]] our algorithm along with the source code. You can also read the [[HERD/Manual|manual]] page.
to:
You can [[HERD/Download|download]] our algorithm along with the source code. You can also read the [[HERD/Usage|manual]] page.
Changed line 5 from:
of viral recombination detection in HIV genome.
to:
of viral recombination detection in HIV genome. In the section [[Method/Method|method]] are discussed algorithms used in HERD.
Changed lines 4-7 from:
herd scores breakpoints individually to maximize the number of correctly predicted annotation boundaries.
to:
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 [[HERD/Download|download]] our algorithm along with the source code. You can also read the [[HERD/Manual|manual]] page.
Changed lines 1-4 from:
(:title Highest Expected Reward Decoding (HERD):)
to:
(: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.
Added line 1:
(:title Highest Expected Reward Decoding (HERD):)
This page was created by Michal Nánási
