Discrete Mathematical Problems with Medical Applications最新文献

On the perfectness of tagged probe interval graphs 标记探针间隔图的完备性

Discrete Mathematical Problems with Medical Applications Pub Date : 1900-01-01 DOI: 10.1090/dimacs/055/11

Li Sheng, Chi-Su Wang, Peisen Zhang

引用次数: 4

Sphere packing using morphological analysis 球体填充物的形态分析

Discrete Mathematical Problems with Medical Applications Pub Date : 1900-01-01 DOI: 10.1090/dimacs/055/04

Qing Wu

引用次数: 11

Medical applications of discrete tomography 离散断层扫描的医学应用

Discrete Mathematical Problems with Medical Applications Pub Date : 1900-01-01 DOI: 10.1090/dimacs/055/15

A. Kuba, G. Herman, S. Matej, A. Todd-Pokropek

引用次数: 17

On computing the nearest neighbor interchange distance 计算最近邻交换距离

Discrete Mathematical Problems with Medical Applications Pub Date : 1900-01-01 DOI: 10.1090/dimacs/055/09

B. Dasgupta, Xin He, Tao Jiang, Ming Li, J. Tromp, Louxin Zhang

{"title":"On computing the nearest neighbor interchange distance","authors":"B. Dasgupta, Xin He, Tao Jiang, Ming Li, J. Tromp, Louxin Zhang","doi":"10.1090/dimacs/055/09","DOIUrl":"https://doi.org/10.1090/dimacs/055/09","url":null,"abstract":"In the practice of molecular evolution, different phylogenetic trees for the same group of species are often produced either by procedures that use diverse optimality criteria [24] or from different genes [15, 16, 17, 18, 14]. Comparing these trees to find their similarities (e.g. agreement or consensus) and dissimilarities, i.e. distance, is thus an important issue in computational molecular biology. The nearest neighbor interchange (nni) distance [29, 28, 34, 3, 6, 2, 19, 20, 23, 33, 22, 21, 26] is a natural distance metric that has been extensively studied. Despite its many appealing aspects such as simplicity and sensitivity to tree topologies, computing this distance has remained very challenging, and many algorithmic and complexity issues about computing this distance have remained unresolved. This paper studies the complexity and efficient approximation algorithms for computing the nni distance and a natural extension of this distance on weighted phylogenies. The following results answer many open questions about the nni distance posed in the literature. 1. Computing the nni distance between two labeled trees is NP-complete. This solves a 25 year old open question appearing again and again in, for example, [29, 34, 3, 6, 2, 19, 20, 23, 22, 21, 26]. 2. Computing the nni distance between two unlabeled trees is also NPcomplete. This answers an open question in [3] for which an erroneous proof appeared in [23]. 3. Biological applications motivate us to extend the nni distance to weighted phylogenies, where edge weights indicate the time-span of evolution along each edge. We present an O(n2) time approximation algorithm for computing the nni distance on weighted phylogenies with a performance ratio of 4 logn+ 4, where n is the number of leaves in the phylogenies. We also observe that the nni distance is in fact identical to the linear-cost subtree-transfer distance on unweighted phylogenies discussed in [4, 5]. Some consequences of this observation are also discussed. 1991 Mathematics Subject Classification. Primary 68Q17, 68W40; Secondary 68Q25. The results reported here also form a subset of the results that appeared in Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 427-436 [4]. The remaining results of the conference paper which do not appear in this paper appeared separately in Algorithmica, Vol. 25, No. 2, pp. 176-195, 1999. The first author was supported by an CGAT (Canadian Genome Analysis and Technology) grant. The second author was supported in part by CGAT and NSF grant 9205982. The third author was supported in part by NSERC Operating Grant OGP0046613 and CGAT. The fourth author was supported by NSERC Operating Grant OGP0046506 and CGAT. The fifth author was supported by an NSERC International Fellowship and CGAT. . Work done while the first author was at University of Waterloo and McMaster University, the second author was visiting at University of Waterloo, the third author was visiting University of Washingt","PeriodicalId":277768,"journal":{"name":"Discrete Mathematical Problems with Medical Applications","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128621461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 63

Transition to epileptic seizures: Optimization 过渡到癫痫发作:优化

Discrete Mathematical Problems with Medical Applications Pub Date : 1900-01-01 DOI: 10.1090/dimacs/055/05

L. Iasemidis, D. Shiau, J. Sackellares, P. Pardalos

引用次数: 46

Computing medial surfaces 计算中间曲面

Discrete Mathematical Problems with Medical Applications Pub Date : 1900-01-01 DOI: 10.1090/dimacs/055/07

S. Bouix, Kaleem Siddiqi

引用次数: 0

Frequent sets in the presence of clones: An example from medical surveillance 在克隆存在的情况下频繁设置:来自医疗监测的一个例子

Discrete Mathematical Problems with Medical Applications Pub Date : 1900-01-01 DOI: 10.1090/dimacs/055/12

S. Brossette, A. Sprague

引用次数: 2

A model for learning human vascular anatomy 一个学习人体血管解剖学的模型

Discrete Mathematical Problems with Medical Applications Pub Date : 1900-01-01 DOI: 10.1090/dimacs/055/02

Peter Hall

引用次数: 6

A study of 3D imaging approaches in medicine 医学中三维成像方法的研究

Discrete Mathematical Problems with Medical Applications Pub Date : 1900-01-01 DOI: 10.1090/dimacs/055/16

J. Udupa

引用次数: 1

Discrete mathematics in medical imaging: A personal view 医学影像中的离散数学:个人观点

Discrete Mathematical Problems with Medical Applications Pub Date : 1900-01-01 DOI: 10.1090/dimacs/055/17

Peter Hall

引用次数: 0