找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Experimental Algorithms; 9th International Sy Paola Festa Conference proceedings 2010 Springer-Verlag Berlin Heidelberg 2010 ARC.algorithm

[复制链接]
楼主: 小天使
发表于 2025-3-28 14:43:10 | 显示全部楼层
发表于 2025-3-28 20:29:44 | 显示全部楼层
发表于 2025-3-28 23:08:32 | 显示全部楼层
发表于 2025-3-29 03:11:32 | 显示全部楼层
发表于 2025-3-29 07:46:58 | 显示全部楼层
Maximum Cliques in Protein Structure Comparisonructure comparison methods can be modeled as maximum clique problems in specific .-partite graphs, referred here as alignment graphs. In this paper, we propose a new protein structure comparison method based on internal distances (DAST), which main characteristic is that it generates alignments havi
发表于 2025-3-29 14:14:33 | 显示全部楼层
Exact Bipartite Crossing Minimization under Tree Constraintse. The task is to draw a tanglegram with a minimum number of tangle crossings while making sure that the trees are drawn crossing-free. This problem has relevant applications in computational biology, e.g., for the comparison of phylogenetic trees. Most existing approaches are only applicable for bi
发表于 2025-3-29 17:02:40 | 显示全部楼层
发表于 2025-3-29 21:02:49 | 显示全部楼层
发表于 2025-3-30 01:24:47 | 显示全部楼层
发表于 2025-3-30 05:34:20 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-21 11:51
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表