Titlebook: Combinatorial Pattern Matching; 14th Annual Symposiu Ricardo Baeza-Yates,Edgar Chávez,Maxime Crochemore Conference proceedings 2003 Springe

ATE

書(shū)目名稱(chēng)Combinatorial Pattern Matching影響因子(影響力)




書(shū)目名稱(chēng)Combinatorial Pattern Matching影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Combinatorial Pattern Matching網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Combinatorial Pattern Matching網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Combinatorial Pattern Matching被引頻次




書(shū)目名稱(chēng)Combinatorial Pattern Matching被引頻次學(xué)科排名




書(shū)目名稱(chēng)Combinatorial Pattern Matching年度引用




書(shū)目名稱(chēng)Combinatorial Pattern Matching年度引用學(xué)科排名




書(shū)目名稱(chēng)Combinatorial Pattern Matching讀者反饋




書(shū)目名稱(chēng)Combinatorial Pattern Matching讀者反饋學(xué)科排名

BRIDE

https://doi.org/10.1007/3-540-44888-8Graph; Matching; Pattern Matching; bioinformatics; computer; data compression; genome; information; multimed

憂(yōu)傷

978-3-540-40311-1Springer-Verlag Berlin Heidelberg 2003

adhesive

Vulnerable

0302-9743 Overview: 978-3-540-40311-1978-3-540-44888-4Series ISSN 0302-9743 Series E-ISSN 1611-3349

Intrepid

Jiaheng Xie,Zhu Zhang,Xiao Liu,Daniel Zengd space .(. log. .). Our result solves an open problem posed by Myers and Miller because it reduces the time complexity of their algorithm by a factor log. . / log log . and the space complexity by a factor log .. For . = 2 genomes, our algorithm takes .(. log .) time and .(.) space.

Intrepid

四牛在彎曲

Multiple Genome Alignment: Chaining Algorithms Revisited,d space .(. log. .). Our result solves an open problem posed by Myers and Miller because it reduces the time complexity of their algorithm by a factor log. . / log log . and the space complexity by a factor log .. For . = 2 genomes, our algorithm takes .(. log .) time and .(.) space.

hematuria

自作多情

Jiaheng Xie,Zhu Zhang,Xiao Liu,Daniel Zengd space .(. log. .). Our result solves an open problem posed by Myers and Miller because it reduces the time complexity of their algorithm by a factor log. . / log log . and the space complexity by a factor log .. For . = 2 genomes, our algorithm takes .(. log .) time and .(.) space.