Login / Signup

Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time.

Jochen AlberJens GrammJiong GuoRolf Niedermeier
Published in: CPM (2002)
Keyphrases
  • beam search
  • hidden markov models
  • worst case
  • machine learning
  • metadata
  • training data
  • search algorithm
  • combinatorial optimization
  • network flow problem