设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Springer电子图书(1)
SpringerLink电子期刊(15)
ProQuest学位论文(1)
Elsevier电子期刊(5)
在“
Elsevier电子期刊
”中,
命中:
5
条,耗时:0.0549732 秒
在所有数据库中总计命中:
22
条
1.
Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization
作者:
Christian Blum
a
;
b
;
christian.blum@ehu.es" class="auth_mail" title="E-mail the corresponding author
;
Pedro Pinacho
a
;
c
;
ppinacho@santotomas.cl" class="auth_mail" title="E-mail the corresponding author
;
Manuel Ló
;
pez-Ibá
;
ñ
;
ez
d
;
manuel.lopez-ibanez@manchester.ac.uk" class="auth_mail" title="E-mail the corresponding author
;
José
;
A. Lozano
a
;
ja.lozano@ehu.es" class="auth_mail" title="E-mail the corresponding author
关键词:
Metaheuristics
;
Exact solver
;
Hybrid algorithms
;
Minimum
common
string
partition
;
Minimum
covering arborescence
刊名:Computers and Operations Research
出版年:2016
2.
Parameterized tractability of the maximum-duo preservation
string
mapping problem
作者:
Stefano Beretta
a
;
b
;
stefano.beretta@disco.unimib.it" class="auth_mail" title="E-mail the corresponding author
;
Mauro Castelli
c
;
mcastelli@novaims.unl.pt" class="auth_mail" title="E-mail the corresponding author
;
Riccardo Dondi
d
;
riccardo.dondi@unibg.it" class="auth_mail" title="E-mail the corresponding author
关键词:
Computational biology
;
Common
string
partition
;
Parameterized algorithms
;
Kernelization
刊名:Theoretical Computer Science
出版年:2016
3.
Quick greedy computation for
minimum
common
string
partition
作者:
Isaac Goldstein
goldshi@cs.biu.ac.il" class="auth_mail
;
Moshe Lewenstein
;
1
;
moshe@cs.biu.ac.il" class="auth_mail
关键词:
String
s
;
Approximation algorithm
;
Pattern matching
刊名:Theoretical Computer Science
出版年:3 July 2014
4.
Solving the maximum duo-preservation
string
mapping problem with linear programming
作者:
Wenbin Chen
a
;
b
;
c
;
1
;
cwb802@aliyun.com" class="auth_mail
;
Zhengzhang Chen
d
;
e
;
Nagiza F. Samatova
d
;
e
;
Lingxi Peng
a
;
Jianxiong Wang
a
;
Maobin Tang
a
关键词:
Approximation algorithm
;
Constrained maximum induced subgraph problem
;
Duo-preservation
string
mapping
;
Linear programming
;
Integer programming
;
Randomized rounding
刊名:Theoretical Computer Science
出版年:17 April, 2014
5.
Approximating reversal distance for
string
s with bounded number of duplicates
作者:
Petr Kolman
;
Tomasz Waleń
关键词:
Approximation algorithms
;
String
comparison
;
Edit distance
;
Sorting by reversals
;
Minimum
common
string
partition
刊名:Discrete Applied Mathematics
出版年:2007
1
按检索点细分(5)
题名(1)
关键词(2)
文摘(4)
按出版年细分(5)
2027年及以后(1)
2016年(2)
2007年(1)
2000年及以前(1)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.