Titlebook: Combinatorial Pattern Matching; 19th Annual Symposiu Paolo Ferragina,Gad M. Landau Conference proceedings 2008 Springer-Verlag Berlin Heide

繁重

Dynamic Fully-Compressed Suffix Treese the disadvantage of being static, not supporting updates to the text. In this paper we show how to support dynamic FCSTs within the same optimal space of the static version and executing all the operations in polylogarithmic time. In particular, we are able to build the suffix tree within optimal space.

noxious

scrape

Flawless

健壮

Wei Zhao,Xitong Guo,Tianshi Wu,Jingxuan Gengstance. We achieve this result by reducing the storage of . to the succinct storage of labeled trees and ternary sequences, for which we properly adapt and orchestrate the use of known compressed data structures.

放大

Parameterized Algorithms and Hardness Results for Some Graph Motif Problemsre W[1]-complete with respect to the subgraph size. Answering an open question from the literature, we further show that the parameter “number of connected motif components” leads to W[1]-hardness even when restricted to graphs that are paths.

起皱纹

Finding Largest Well-Predicted Subset of Protein Structure Modelsits native structure in time .(.(loglog. + log1/.)/..). We have implemented our algorithms and results indicate our program finds much more matched pairs with less running time than TMScore, which is one of the most popular tools to assess the quality of predicted models.

飞镖

不再流行

贪婪性

ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populationsthematical and practical results on phylogenetic networks with recombination and show applications of these results to several issues in Population Genomics..Various parts of this work are joint work with Satish Eddhu, Chuck Langley, Dean Hickerson, Yun S. Song, Yufeng Wu, V. Bansal, V. Bafna and Z.