Titlebook: Combinatorial Pattern Matching; 4th Annual Symposium Alberto Apostolico,Maxime Crochemore,Udi Manber Conference proceedings 1993 Springer-V

Robust

An algorithm for locating non-overlapping regions of maximum alignment score,coring alignment between them. This significantly improves the previously best known bound of ..) for the worst-case complexity of this problem. One of the central ideas in the design of this algorithm is that of partitioning a matrix into pieces in such a way that all submatrices of interest for th

想象

Exact and approximation algorithms for the inversion distance between two chromosomes, consider the problem of computing the shortest series of reversals that transform one permutation to another. The permutations describe the order of genes on corresponding chromosomes, and a . takes an arbitrary substring of elements and reverses their order..For this problem we develop two algorit

冷淡周边

arthroscopy