发布求助
文献互助 智能选刊 最新文献

Journal of Combinatorial Optimization最新文献

筛选
英文 中文
Signed rearrangement distances considering repeated genes, intergenic regions, and indels 考虑重复基因、基因间区域和indel的符号重排距离
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2023-09-10 DOI: 10.1007/s10878-023-01083-w
Gabriel Siqueira, Alexsandro Oliveira Alexandrino, Zanoni Dias
{"title":"Signed rearrangement distances considering repeated genes, intergenic regions, and indels","authors":"Gabriel Siqueira, Alexsandro Oliveira Alexandrino, Zanoni Dias","doi":"10.1007/s10878-023-01083-w","DOIUrl":"https://doi.org/10.1007/s10878-023-01083-w","url":null,"abstract":"<p>Genome rearrangement distance problems allow to estimate the evolutionary distance between genomes. These problems aim to compute the minimum number of mutations called rearrangement events necessary to transform one genome into another. Two commonly studied rearrangements are the reversal, which inverts a sequence of genes, and the transposition, which exchanges two consecutive sequences of genes. Seminal works on this topic focused on the sequence of genes and assumed that each gene occurs exactly once on each genome. More realistic models have been assuming that a gene may have multiple copies or may appear in only one of the genomes. Other models also take into account the nucleotides between consecutive pairs of genes, which are called intergenic regions. This work combines all these generalizations defining the signed intergenic reversal distance (SIRD), the signed intergenic reversal and transposition distance (SIRTD), the signed intergenic reversal and indels distance (SIRID), and the signed intergenic reversal, transposition, and indels distance (SIRTID) problems. We show a relation between these problems and the signed minimum common intergenic string partition (SMCISP) problem. From such relation, we derive <span>(varTheta (k))</span>-approximation algorithms for the SIRD and the SIRTD problems, where <i>k</i> is maximum number of copies of a gene in the genomes. These algorithms also work as heuristics for the SIRID and SIRTID problems. Additionally, we present some parametrized algorithms for SMCISP that ensure constant approximation factors for the distance problems. Our experimental tests on simulated genomes show an improvement on the rearrangement distances with the use of the partition algorithms.\u0000</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71508281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Online k-color spanning disk problems 在线k色生成盘问题
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2023-09-01 DOI: 10.1007/s10878-023-01080-z
Yin Wang, Yinfeng Xu, Huili Zhang, Weitian Tong
{"title":"Online k-color spanning disk problems","authors":"Yin Wang, Yinfeng Xu, Huili Zhang, Weitian Tong","doi":"10.1007/s10878-023-01080-z","DOIUrl":"https://doi.org/10.1007/s10878-023-01080-z","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45745279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller 一种改进的在线补货策略及其对订单卖家的竞争比分析
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2023-08-31 DOI: 10.1007/s10878-023-01079-6
Guanqun Ni
{"title":"An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller","authors":"Guanqun Ni","doi":"10.1007/s10878-023-01079-6","DOIUrl":"https://doi.org/10.1007/s10878-023-01079-6","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47367309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal design of garments for high-temperature operations based on the finite difference method 基于有限差分法的高温作业服装优化设计
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2023-08-26 DOI: 10.1007/s10878-023-01077-8
Jiang-Hao Li, Hao Xu
{"title":"Optimal design of garments for high-temperature operations based on the finite difference method","authors":"Jiang-Hao Li, Hao Xu","doi":"10.1007/s10878-023-01077-8","DOIUrl":"https://doi.org/10.1007/s10878-023-01077-8","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45132982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Complete forcing numbers of complete and almost-complete multipartite graphs 完全和几乎完全多部分图的完全强迫数
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2023-08-24 DOI: 10.1007/s10878-023-01078-7
Xin He, He Zhang
{"title":"Complete forcing numbers of complete and almost-complete multipartite graphs","authors":"Xin He, He Zhang","doi":"10.1007/s10878-023-01078-7","DOIUrl":"https://doi.org/10.1007/s10878-023-01078-7","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43212280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Alternating-direction-method-of-multipliers-based fast model predictive control for an aerial trees-pruning robot 基于乘法器交替方向法的空中剪枝机器人快速模型预测控制
4区 数学
Journal of Combinatorial Optimization Pub Date : 2023-08-01 DOI: 10.1007/s10878-023-01071-0
Changliang Xu, Hao Xu, Zhong Yang, Jiying Wu, Luwei Liao, Qiuyan Zhang
{"title":"Alternating-direction-method-of-multipliers-based fast model predictive control for an aerial trees-pruning robot","authors":"Changliang Xu, Hao Xu, Zhong Yang, Jiying Wu, Luwei Liao, Qiuyan Zhang","doi":"10.1007/s10878-023-01071-0","DOIUrl":"https://doi.org/10.1007/s10878-023-01071-0","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136064948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A combinatorial approximation algorithm for k-level facility location problem with submodular penalties 具有次模惩罚的k级设施选址问题的组合逼近算法
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2023-08-01 DOI: 10.1007/s10878-023-01067-w
Li Zhang, Jing Yuan, Zhizhen Xu, Qiaoliang Li
{"title":"A combinatorial approximation algorithm for k-level facility location problem with submodular penalties","authors":"Li Zhang, Jing Yuan, Zhizhen Xu, Qiaoliang Li","doi":"10.1007/s10878-023-01067-w","DOIUrl":"https://doi.org/10.1007/s10878-023-01067-w","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46298163","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
International market risk, monetary policy stance, and corporate financing: China’s economic recovery in the post-pandemic era 国际市场风险、货币政策立场和企业融资：后疫情时代的中国经济复苏
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2023-08-01 DOI: 10.1007/s10878-023-01072-z
Cheng-Ben Wang, Qian Zhong
{"title":"International market risk, monetary policy stance, and corporate financing: China’s economic recovery in the post-pandemic era","authors":"Cheng-Ben Wang, Qian Zhong","doi":"10.1007/s10878-023-01072-z","DOIUrl":"https://doi.org/10.1007/s10878-023-01072-z","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47218678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost 最小化完工时间的k次方加上总拒绝成本的拒绝调度问题
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2023-08-01 DOI: 10.1007/s10878-023-01074-x
Lingfa Lu, Liqi Zhang
{"title":"Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost","authors":"Lingfa Lu, Liqi Zhang","doi":"10.1007/s10878-023-01074-x","DOIUrl":"https://doi.org/10.1007/s10878-023-01074-x","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45152124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty 距离不确定性下编码无线分组网络组播传输能耗最小化的鲁棒优化
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2023-08-01 DOI: 10.1007/s10878-023-01065-y
M. Raayatpanah, T. Weise, Jinsong Wu, Ming Tan, P. Pardalos
{"title":"Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty","authors":"M. Raayatpanah, T. Weise, Jinsong Wu, Ming Tan, P. Pardalos","doi":"10.1007/s10878-023-01065-y","DOIUrl":"https://doi.org/10.1007/s10878-023-01065-y","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42138605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信