tailieunhanh - Efficient implied alignment

Given a binary tree T of n leaves, each leaf labeled by a string of length at most k, and a binary string alignment function ⊗, an implied alignment can be generated to describe the alignment of a dynamic homology for T . |

TÀI LIỆU LIÊN QUAN