找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algorithms in Bioinformatics; 12th International W Ben Raphael,Jijun Tang Conference proceedings 2012 Springer-Verlag Berlin Heidelberg 201

[复制链接]
楼主: palliative
发表于 2025-3-28 17:45:46 | 显示全部楼层
发表于 2025-3-28 21:13:47 | 显示全部楼层
Fast Phylogenetic Tree Reconstruction Using Locality-Sensitive Hashing,y a Markov model of evolution. Due to rapid expansion in sequence databases, such very fast algorithms are necessary. Other fast heuristics have been developed for building trees from large alignments [18,1], but they lack theoretical performance guarantees. Our new algorithm runs in .(..log..) time
发表于 2025-3-28 23:46:04 | 显示全部楼层
发表于 2025-3-29 04:46:11 | 显示全部楼层
SibJoin: A Fast Heuristic for Half-Sibling Reconstruction, particularly in endangered populations. Although many solutions exist for reconstructing full-sibling relationships, few exist for half-siblings. We present SibJoin, a heuristic-based clustering approach based on Mendelian genetics, which is reasonably accurate and thousands of times faster than ex
发表于 2025-3-29 07:20:09 | 显示全部楼层
发表于 2025-3-29 11:33:35 | 显示全部楼层
Estimating Population Size via Line Graph Reconstruction, haplotypes between individuals and is based on transforming the graph of potential haplotype sharing into a line graph using a minimum number of edge and vertex deletions. We show that the problems are NP complete and provide exact integer programming solutions for them. We test our approach using
发表于 2025-3-29 16:38:36 | 显示全部楼层
Extracting Conflict-Free Information from Multi-labeled Trees,conflicting phylogenetic relationships for the same set of taxa, but can also contain conflict-free information that is of interest and yet is not obvious. We define the information content of a MUL-tree . as the set of all conflict-free quartet topologies implied by . , and define the maximal reduc
发表于 2025-3-29 23:14:03 | 显示全部楼层
发表于 2025-3-30 00:51:25 | 显示全部楼层
An Optimal Reconciliation Algorithm for Gene Trees with Polytomies,ee with a species tree, and interpreting the incongruence between the two trees as evidence of duplication and loss. In the case of binary rooted trees, linear-time algorithms have been developed for the duplication, loss, and mutation (duplication + loss) costs. However, a strict prerequisite to re
发表于 2025-3-30 07:20:18 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-8 15:29
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表