Titlebook: Combinatorial Pattern Matching; 10th Annual Symposiu Maxime Crochemore,Mike Paterson Conference proceedings 1999 Springer-Verlag Berlin Hei

果園

書目名稱Combinatorial Pattern Matching影響因子(影響力)




書目名稱Combinatorial Pattern Matching影響因子(影響力)學(xué)科排名




書目名稱Combinatorial Pattern Matching網(wǎng)絡(luò)公開度




書目名稱Combinatorial Pattern Matching網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Combinatorial Pattern Matching被引頻次




書目名稱Combinatorial Pattern Matching被引頻次學(xué)科排名




書目名稱Combinatorial Pattern Matching年度引用




書目名稱Combinatorial Pattern Matching年度引用學(xué)科排名




書目名稱Combinatorial Pattern Matching讀者反饋




書目名稱Combinatorial Pattern Matching讀者反饋學(xué)科排名

引起痛苦

Irascible

Fast Multi-dimensional Approximate Pattern Matching,ains better than dynamic programming for . ≤ . ./(.(logσ . -logσ .)).. These are the first search algorithms for the problem. As side-effects we extend to d dimensions an already proposed algorithm for two-dimensional exact string matching, and we obtain a sublinear-time filter to search in . dimens

Herpetologist

同步信息

Anurag Kumar Verma,Saurabh Pal,Surjeet Kumarread of genes from each chromosome. We then prove a monotonicity property for the syntenic distance, and bound the difficulty of the hardest instance of any given size. We briefly discuss the results of implementing these algorithms and testing them on real synteny data.

睨視

睨視

aphasia

荒唐

On the Complexity of Positional Sequencing by Hybridization,ving the positional SBH problem when each substring has at most two possible positions. On the other hand, we prove that the problem is NP-complete if each substring has at most three possible positions.

GIST