document: Edit distance of run-length encoded strings Let X and Y be two run-length encoded strings , of encoded lengths k and l , respectively . We present a simple O -LRB- | X | l + | Y | k -RRB- time algorithm that computes their edit distance
doc_bio_tags: B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B O O O B I