期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

Integer Programming Models for Computational Biology Problems 被引量：1

Integer Programming Models for Computational Biology Problems
原文传递
导出
摘要 The recent years have seen an impressive increase in the use of IntegerProgramming models for the solution of optimization problems originating in Molecular Biology. Inthis survey, some of the most successful Integer Programming approaches are described, while a broadoverview of application areas being is given in modern Computational Molecular Biology. The recent years have seen an impressive increase in the use of IntegerProgramming models for the solution of optimization problems originating in Molecular Biology. Inthis survey, some of the most successful Integer Programming approaches are described, while a broadoverview of application areas being is given in modern Computational Molecular Biology.
作者 GiuseppeLancia
机构地区 D.I.M.I
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2004年第1期60-77,共18页 计算机科学技术学报（英文版）
关键词 integer programming computational biology sequence alignment genomerearrangements protein structures integer programming computational biology sequence alignment genomerearrangements protein structures
分类号 Q78 [生物学—分子生物学]
  • 相关文献

参考文献50

  • 1Nemhauser G L, Wolsey L. Integer and Combinatorial Optimization. New York: John Wiley & Sons, 1988.
  • 2Cook W J, Cunningham W H, Pulleyblank W R, Schrijver A. Combinatorial Optimization. New York: John Wiley & Sons, 1998.
  • 3Schrijver A. Theory of Linear and Integer Programming. New York: John Wiley & Sons, 1986.
  • 4Reinert K, Lenhof H-P, Mutzel P, Mehlhorn K, Kececioglu J. A branch-and-cut algorithm for multiple sequence alignment.In Proc. the Annual International Conference on Computational Molecular Biology (RECOMB), 1997, pp.241-249.
  • 5Kececioglu J, Lenhof It-P, Mehlhorn K, Mutzel P, Reinerr K, Vingron M. A polyhedral approach to sequence alignment problems.Discrete Applied Mathematics, 2000, 104: 143-186.
  • 6Fischetti M, Lancia G, Serafini P. Exact algorithms for minimum routing cost trees. Networks, 2002, 39(3): 161-173.
  • 7Gusfield D. Efficient methods for multiple sequence alignment with guaranteed error bounds. Bulletin of Mathematical Biology, 1993, 55: 141-154.
  • 8Ben-Dor A, Lancia G-, Perone J, Ravi R. Banishing bias from consensus sequences. In Proc. the Annual Symposium on Combinatorial Pattern Matching (CPM), Lecture Notes in Computer Science 1264, 1997, pp.247-261.
  • 9Li M, Ma B, Wang L. On the closest string and substring problems. Journal of the ACM. 2002.49(2): 157-171.
  • 10Ma B. A polynomial time approximation scheme for the closest substring problem. In Proc. the Annual Symposium on Combinatorial Parterre Matching (CPM), Lecture Notes in Computer Science 1848, 2000, pp.99-107.

同被引文献5

  • 1Bonch D,Franklin M.Identity based encryption from the weil pairing:Proc crypto 2001 [C].LNCS:Springer-Verlag,2001.213-229.
  • 2Zhang F,Safavi-Naini R,Susilo W.An efficient signature scheme from bilinear pairings and its applications:PKC 2004[C].LNCS:Springer-Verlag,2004.
  • 3William Stallings.密码编码学与网络安全原理与实践[M].北京:电子工业出版社,2003.154-159.
  • 4冯登国.基于数字签名标准的可验证的签名共享方案[J].计算机工程与设计,1997,18(5):64-64. 被引量：4
  • 5王泽成,斯桃枝,李志斌,周振江.基于身份的代理签名和盲签名[J].计算机工程与应用,2003,39(23):148-150. 被引量：13

引证文献1

二级引证文献1

Journal of Computer Science & Technology
2004年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部