找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 29150|回复: 57
发表于 2025-3-21 18:12:59 | 显示全部楼层 |阅读模式
书目名称Combinatorial Pattern Matching
副标题14th Annual Symposiu
编辑Ricardo Baeza-Yates,Edgar Chávez,Maxime Crochemore
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Combinatorial Pattern Matching; 14th Annual Symposiu Ricardo Baeza-Yates,Edgar Chávez,Maxime Crochemore Conference proceedings 2003 Springe
出版日期Conference proceedings 2003
关键词Graph; Matching; Pattern Matching; bioinformatics; computer; data compression; genome; information; multimed
版次1
doihttps://doi.org/10.1007/3-540-44888-8
isbn_softcover978-3-540-40311-1
isbn_ebook978-3-540-44888-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2003
The information of publication is updating

书目名称Combinatorial Pattern Matching影响因子(影响力)




书目名称Combinatorial Pattern Matching影响因子(影响力)学科排名




书目名称Combinatorial Pattern Matching网络公开度




书目名称Combinatorial Pattern Matching网络公开度学科排名




书目名称Combinatorial Pattern Matching被引频次




书目名称Combinatorial Pattern Matching被引频次学科排名




书目名称Combinatorial Pattern Matching年度引用




书目名称Combinatorial Pattern Matching年度引用学科排名




书目名称Combinatorial Pattern Matching读者反馈




书目名称Combinatorial Pattern Matching读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:10:12 | 显示全部楼层
https://doi.org/10.1007/3-540-44888-8Graph; Matching; Pattern Matching; bioinformatics; computer; data compression; genome; information; multimed
发表于 2025-3-22 03:55:26 | 显示全部楼层
978-3-540-40311-1Springer-Verlag Berlin Heidelberg 2003
发表于 2025-3-22 07:29:43 | 显示全部楼层
发表于 2025-3-22 10:22:28 | 显示全部楼层
0302-9743 Overview: 978-3-540-40311-1978-3-540-44888-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-22 14:35:27 | 显示全部楼层
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.
发表于 2025-3-22 20:01:42 | 显示全部楼层
发表于 2025-3-23 00:59:04 | 显示全部楼层
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.
发表于 2025-3-23 05:19:11 | 显示全部楼层
发表于 2025-3-23 06:17:50 | 显示全部楼层
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.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-28 11:30
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表