The Gram-negative bacterial genus Brucella includes six classic species based on host specificity,pathogenicity and phenotypic differences.Four more Brucella species were identified in 2007.Although many Brucella geno...The Gram-negative bacterial genus Brucella includes six classic species based on host specificity,pathogenicity and phenotypic differences.Four more Brucella species were identified in 2007.Although many Brucella genomes have been sequenced,genome sequences and analysis of Brucella strains isolated in China are still scarce.An efficient genome-based Brucella typing method is also needed.In this study,we used the minimum core genome(MCG)typing method to identify and type Brucella strains.Twenty Brucella isolates fromChinawere newly sequenced.The genome sequences of 55 representative Brucella strainswere downloaded.Among the 75 genomes,1089 genes and 52,030 single nucleotide polymorphisms(SNPs)shared by all isolates were considered as the MCG genes and MCG SNPs.Using these 52,030 MCG SNPs,Brucella was divided into six MCG groups.In addition,average nucleotide identity(ANI)values and the distributions of 184 virulence genes were all computed.The proportions of virulence genes were 90.96%,93.56%,95.89%,86.04%,85.78%and 91.87%for MCG groups 1 to 6,respectively.The intragroup ANI values were higher than the intergroup values,further confirming the validity of the MCG taxonomy classification.Brucella melitensis and Brucella abortus,the two main Brucella species pathogenic to humans,were well separated from other species.With the development and cost reduction of next-generation sequencing,theMCG typing method can be used for rapid identification of Brucella,which can contribute to the rapid diagnosis of brucellosis and ensure timely and effective treatment.展开更多
Explaining the causes of infeasibility of Boolean formulas has many practical applications in electronic design automation and formal verification of hardware.Furthermore,a minimum explanation of infeasibility that ex...Explaining the causes of infeasibility of Boolean formulas has many practical applications in electronic design automation and formal verification of hardware.Furthermore,a minimum explanation of infeasibility that excludes all irrelevant information is generally of interest.A smallest-cardinality unsatisfiable subset called a minimum unsatisfiable core can provide a succinct explanation of infea-sibility and is valuable for applications.However,little attention has been concentrated on extraction of minimum unsatisfiable core.In this paper,the relationship between maximal satisfiability and mini-mum unsatisfiability is presented and proved,then an efficient ant colony algorithm is proposed to derive an exact or nearly exact minimum unsatisfiable core based on the relationship.Finally,ex-perimental results on practical benchmarks compared with the best known approach are reported,and the results show that the ant colony algorithm strongly outperforms the best previous algorithm.展开更多
相同应用领域,不同时间、地点或设备检测到的数据域不一定完整.文中针对如何进行数据域间知识传递问题,提出相同领域的概率分布差异可用两域最小包含球中心点表示且其上限与半径无关的定理.基于上述定理,在原有支持向量域描述算法基础上...相同应用领域,不同时间、地点或设备检测到的数据域不一定完整.文中针对如何进行数据域间知识传递问题,提出相同领域的概率分布差异可用两域最小包含球中心点表示且其上限与半径无关的定理.基于上述定理,在原有支持向量域描述算法基础上,提出一种数据域中心校正的领域自适应算法,并利用人造数据集和KDD CUP 99入侵检测数据集验证该算法.实验表明,这种领域自适应算法具有较好的性能.展开更多
基金supported by the Special Scientific Research Fund in the Public Interest of National Health and Family Planning Commission(no.201302006)the Xinjiang Nature Science Foundation(2016D01A065)National Key Programfor Infectious Diseases of China(2013ZX10004221 and 2014ZX10004003).
文摘The Gram-negative bacterial genus Brucella includes six classic species based on host specificity,pathogenicity and phenotypic differences.Four more Brucella species were identified in 2007.Although many Brucella genomes have been sequenced,genome sequences and analysis of Brucella strains isolated in China are still scarce.An efficient genome-based Brucella typing method is also needed.In this study,we used the minimum core genome(MCG)typing method to identify and type Brucella strains.Twenty Brucella isolates fromChinawere newly sequenced.The genome sequences of 55 representative Brucella strainswere downloaded.Among the 75 genomes,1089 genes and 52,030 single nucleotide polymorphisms(SNPs)shared by all isolates were considered as the MCG genes and MCG SNPs.Using these 52,030 MCG SNPs,Brucella was divided into six MCG groups.In addition,average nucleotide identity(ANI)values and the distributions of 184 virulence genes were all computed.The proportions of virulence genes were 90.96%,93.56%,95.89%,86.04%,85.78%and 91.87%for MCG groups 1 to 6,respectively.The intragroup ANI values were higher than the intergroup values,further confirming the validity of the MCG taxonomy classification.Brucella melitensis and Brucella abortus,the two main Brucella species pathogenic to humans,were well separated from other species.With the development and cost reduction of next-generation sequencing,theMCG typing method can be used for rapid identification of Brucella,which can contribute to the rapid diagnosis of brucellosis and ensure timely and effective treatment.
基金the National Natural Science Foundation of China (No.60603088)
文摘Explaining the causes of infeasibility of Boolean formulas has many practical applications in electronic design automation and formal verification of hardware.Furthermore,a minimum explanation of infeasibility that excludes all irrelevant information is generally of interest.A smallest-cardinality unsatisfiable subset called a minimum unsatisfiable core can provide a succinct explanation of infea-sibility and is valuable for applications.However,little attention has been concentrated on extraction of minimum unsatisfiable core.In this paper,the relationship between maximal satisfiability and mini-mum unsatisfiability is presented and proved,then an efficient ant colony algorithm is proposed to derive an exact or nearly exact minimum unsatisfiable core based on the relationship.Finally,ex-perimental results on practical benchmarks compared with the best known approach are reported,and the results show that the ant colony algorithm strongly outperforms the best previous algorithm.
文摘相同应用领域,不同时间、地点或设备检测到的数据域不一定完整.文中针对如何进行数据域间知识传递问题,提出相同领域的概率分布差异可用两域最小包含球中心点表示且其上限与半径无关的定理.基于上述定理,在原有支持向量域描述算法基础上,提出一种数据域中心校正的领域自适应算法,并利用人造数据集和KDD CUP 99入侵检测数据集验证该算法.实验表明,这种领域自适应算法具有较好的性能.
