Titlebook: Combinatorial Pattern Matching; 21st Annual Symposiu Amihood Amir,Laxmi Parida Conference proceedings 2010 Springer-Verlag Berlin Heidelber

歹徒

Succinct Representations of Separable Graphs,hmic word size. In particular, we show constant-time support for adjacency, degree and neighborhood queries. For any monotone class of separable graphs, the storage requirement of the representation is optimal to within lower order terms..Separable graphs are those that admit a .(..)-separator theor

火海

雪上輕舟飛過

晚間

The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection,several limitations of the Viterbi decoding have been demonstrated, and new algorithms have been developed to address them (Kall et al., 2005; Brejova et al., 2007; Gross et al., 2007; Brown and Truszkowski, 2010). In this paper, we propose a new efficient highest expected reward decoding algorithm

持續(xù)

,Phylogeny- and Parsimony-Based Haplotype?Inference?with?Constraints,aplotyping method is based on an evolutionary model where a perfect phylogenetic tree is sought that explains the observed data. In their .?2009 paper, Fellows et al. studied an extension of this approach that incorporates prior knowledge in the form of a set of candidate haplotypes from which the r

華而不實

Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks,works. Given two networks ..,.. with . leaves, . nodes, and . edges, the Robinson-Foulds distance measures the number of clusters of descendant leaves that are not shared by .. and ... The fastest known algorithm for computing the Robinson-Foulds distance between those networks runs in .(.(.?+?.)) t

洞察力

Mod/Resc Parsimony Inference,pulate natural insect populations infected by inherited, intra-cellular parasitic bacteria. In this problem, that we denote by ., we are given a boolean matrix and the goal is to find two other boolean matrices with a minimum number of columns such that an appropriately defined operation on these ma

Rinne-Test

有偏見

懸掛