An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem

Published:2006-05 Issue:4 Volume:13 Page:979-989
ISSN:1066-5277
Container-title:Journal of Computational Biology
language:en
Short-container-title:Journal of Computational Biology

Author:

Colannino Justin¹,Damian Mirela²,Hurtado Ferran³,Iacono John⁴,Meijer Henk⁵,Ramaswami Suneeta⁶,Toussaint Godfried¹

Affiliation:

1. School of Computer Science, McGill University, Montréal, Québec Canada H3A 2A7.

2. Department of Computer Science, Villanova University, Villanova, PA 19085.

3. Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, E-08034 Barcelona, Spain.

4. Department of Computer and Information Science, Polytechnic University, Brooklyn, NY 11201.

5. School of Computing, Queen’s University, Kingston, Ontario Canada KL7 3N6.

6. Department of Computer Science, Rutgers University—Camden, Camden, New Jersey 08102.

Publisher

Mary Ann Liebert Inc

Subject

Computational Theory and Mathematics,Computational Mathematics,Genetics,Molecular Biology,Modeling and Simulation

Link

http://www.liebertpub.com/doi/pdf/10.1089/cmb.2006.13.979

Reference15 articles.

1. Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality

2. A survey of heuristics for the weighted matching problem

3. The Restriction Scaffold Problem

4. Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours

5. An algorithm for computing the restriction scaffold assignment problem in computational biology

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New variants of perfect non-crossing matchings;Discrete Applied Mathematics;2024-01

2. New Variants of Perfect Non-crossing Matchings;Algorithms and Discrete Applied Mathematics;2021

3. Comment: Matching Methods for Observational Studies Derived from Large Administrative Databases;Statistical Science;2020-08-01

4. Mathematics and Flamenco: An Unexpected Partnership;The Mathematical Intelligencer;2017-04-19

5. Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences;Graphs and Combinatorics;2014-09-23

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3