Volume 4 Supplement 2
Selected articles from the Third International Symposium on Optimization and Systems Biology
Computational inference and analysis of genetic regulatory networks via a supervised combinatorial-optimization pattern
- Binhua Tang^{1},
- Xuechen Wu^{2},
- Ge Tan^{3},
- Su-Shing Chen^{4},
- Qing Jing^{5} and
- Bairong Shen^{6}Email author
DOI: 10.1186/1752-0509-4-S2-S3
© Shen et al; licensee BioMed Central Ltd. 2010
Published: 13 September 2010
Abstract
Background
Post-genome era brings about diverse categories of omics data. Inference and analysis of genetic regulatory networks act prominently in extracting inherent mechanisms, discovering and interpreting the related biological nature and living principles beneath mazy phenomena, and eventually promoting the well-beings of humankind.
Results
A supervised combinatorial-optimization pattern based on information and signal-processing theories is introduced into the inference and analysis of genetic regulatory networks. An associativity measure is proposed to define the regulatory strength/connectivity, and a phase-shift metric determines regulatory directions among components of the reconstructed networks. Thus, it solves the undirected regulatory problems arising from most of current linear/nonlinear relevance methods. In case of computational and topological redundancy, we constrain the classified group size of pair candidates within a multiobjective combinatorial optimization (MOCO) pattern.
Conclusions
We testify the proposed approach on two real-world microarray datasets of different statistical characteristics. Thus, we reveal the inherent design mechanisms for genetic networks by quantitative means, facilitating further theoretic analysis and experimental design with diverse research purposes. Qualitative comparisons with other methods and certain related focuses needing further work are illustrated within the discussion section.
Background
Various cell phenotypes and functions within multi-cellular organisms relate directly to genetic contents decoded from DNA and RNA during transcriptional and translational processes. Inference of gene regulatory networks or maps for those intercellular processes plays significant roles in the further comprehension of underlying regulatory mechanisms. Thus reconstructing such biological regulatory networks directly from gene profile datasets measured at different cell phases, types and even species becomes one of the foremost research topics recently.
Due to capabilities of simultaneous measurement for multiple expression profiles with gradually increasing accuracy and decreasing costs of experiments, those advances in high-throughput microarray and ChIP assays techniques facilitate the corresponding learning and inference of the regulatory maps and even functionality of these genetic networks. During the past decades, manifold inference and learning methods have been proposed to integrate raw data to computational frameworks for network models, such as (probabilistic) Boolean network and (dynamic) Bayesian network, systematic differential/difference equations [1–6], information theory-based modelling [7–10], graph and control theoretic approaches [11–13].
Furthermore, most of current biochemical networks are regarded as static descriptions of the inherent regulatory mechanisms in the sense that once the system models and parameters for those genetic networks are set, the regulatory processes are determined. While during genetic transcriptional and translational processes, real-world regulatory maps may undergo various perturbations from intercellular and intracellular signals and undiscovered factors. From this perspective, a single modelling mode may not be sufficient to characterize all kinds of possible structures of these networks, or even crucial ones for specific analysis purposes. The problems above solicit flexible mechanism designs to improve the present rigid methods for network inference.
Within the following parts, we propose an integrative supervised learning method for the inference of time-delayed cell cycle regulatory mechanism based on information and signal processing theories. We firstly introduce definitions for those crucial concepts as correlation measure and mutual information; then we propose a novel associative quantity for the two kinds of dependency measures. With the proposed integrative metric and the P-values from the Pearson correlation operations on all pairwise genes from the raw data pool, we may determine the dependency and connectivity among those pairwise candidates. Such kind of integrative dependency metric improves the performance of above one-fold linear or nonlinear criterion since multiple-criteria may perform cross validation functions for measuring dependency within the test results.
Moreover, from signal processing theory [5, 14–16], a phase-shift metric is introduced for measuring time delay of gene expression within pairwise candidates. The advantages of such a phase-shift metric lie in its flexible characteristics of determining the regulatory delay variation via dynamic thresholds of relevant transfer gains between pairwise candidates. Since factual regulatory mechanisms possess multiple possibilities during biological processes and underlying regulatory delay effects may vary in the context of related courses. The phase-shift metric elucidates such possibilities underlying the regulatory mechanisms quantitatively via dynamic threshold of transfer gains.
The other advantage of the method includes its inherent capabilities of integrating existing biological knowledge as a priori. This kind of knowledge-based inference method avoids redundant false-positive connectivity within pairwise gene candidates. Moreover, dynamic threshold for transfer gain facilitates its potential applicability to the majority of problems facing theoretic and experimental biologists. Since regulatory connectivity underlying pairwise gene candidates may differ from each other at various tissues and sampling times, quantitative determination of these regulations with existing empirical and theoretical knowledge will act as much more effective roles, compared to most of current simplex computational approaches.
Results
The supervised learning framework mainly covers two aspects, namely, it should characterize pairwise regulatory strengths and constrain subsequent computational redundancy. We utilize the proposed method for two real-world datasets, selected from the Stanford Microarray Database. The both datasets are of different statistical characteristics, normalized and benchmarked in the recent literatures [17–19].
Analysis on the Saccharomyces cerevisiae cell cycle microarray dataset
Based on the definitions and concepts illustrated in the methodology part, we calculated the mutual information, correlation and P-values among pairwise genes for constructing regulatory activities. The mutual information matrix, correlation and corresponding P-values are given in the additional Figure 1-A in Additional file 1 and additional Figure 1-B in Additional file 2.
As depicted in the lower sub-graph of the additional Figure 1-B in Additional file 2, there are more than 101 pairs with their P-values not greater than 0.05 (indicated by the vertical line), commonly adopted in most research fields. Therefore around 60% or 165 hypothetic reaction edges are redundant and may be reduced for the further reconstruction of the regulatory network, and thus in this map, on average, every gene has direct or indirect relations with 4 to 5 other genes. The phenomena conform to the generally recognized viewpoints that most biochemical regulatory networks are sparsely constructed.
The supervised inference procedure starts from the respective centroids, i.e. 0.5709 and 0.4358 for mutual information and correlation coefficient. Actually, from the heat maps illustrated in Figure 2, we may find the proximately-diagonal symmetries of the variations between mutual information and correlation coefficient, especially for the group APGs. Such interesting phenomena facilitate detecting suitable initial thresholds and optimal iteration tracks.
Also with the acquired knowledge, e.g. the genetic networks are sparsely constructed and their topologies normally follow the ‘small-world’ properties, the interactive computations halt at 0.4950 for mutual information and 0.4602 for correlation thresholds. At the terminated thresholds, the APGs, QPGs and UPGs groups have 83, 157 and 36 candidates respectively.
As depicted, only the gene #4 (YDL056W) is isolated from the network structure, meaning that YDL056W might belong to other regulatory processes at the current situation. Besides, the gene #2 (YER111C) only has a single regulatory link, similar to the genes #9 (YLR079W) and #10 (YAL040C). While for such genes as #1 (YDR146C), #3 (YLR182W), #16 (YDR507C), etc., they have multiple regulatory links, indicating they undertake much more responsibilities during the underlying interaction and regulation processes.
Since the above analysis is for the case of normal statistical characteristics, one may directly utilize the proposed methods. Within the following part, we discuss another kind of microarray dataset of different statistical properties.
Analysis on the dataset from a p53 pathway with multiple feedback loops
However, this kind of dataset does not satisfy the above network-constructing algorithm since there are only 10 pair candidates with their P-values below 0.05 (91.7% of the total pairs with correlation statistical significance above 0.05), see the additional Figure 5-B in Additional file 6. Therefore, it is impossible to construct a genetic network of 16 genes with just 10 suitable candidate links under the current situation. Thus, before utilizing the PGHC algorithm, it is necessary to modify the P-value threshold.
Within the following network-building procedure, we still choose the corresponding centroids of both metrics as the initial points for the iterative computation. The centroids for the mutual information and correlation coefficients for the totally available pairs are 0.7992 and 0.5203 respectively.
Discussion
The comparison with the currently-available inference methods
Currently, there exist several inference approaches for the biochemical networks, e.g. probabilistic approaches, equation-based methods, etc. As depicted within the context, the proposed method tackles such key inference issues for integrating previously-acquired biological knowledge as a priori via dynamic threshold of multi-source information. Thus compared with most computation-oriented methods, the proposed inference framework ameliorates inference accuracy and experimental achievements within a problem-oriented scheme.
Secondly, the proposed method tackles one of most important problems from the perspective of signal processing theory, namely, the determination of regulatory directions between candidate gene pairs. The introduced metrics quantify those underlying regulatory strengths, directions between pair candidates globally and comparatively. Thus, it facilitates the follow-up network-rebuilding procedure.
Moreover, the proposed inference framework might illustrate in parallel multiple optimal or suboptimal potential regulatory maps, instead of the one computational solution for one problem scheme, since for most cases such solutions cannot explain convincingly so much inherent mechanism as expected. The proposed method might utilize the diverse knowledge available, either from concrete biochemical experiments or current literatures.
The current focuses of the proposed method and its future directions
Although the proposed inference framework is validated with the real-world profile datasets, there are still several directions needing further refinement, depicted within the below section.
In practice, most available profile datasets are of high dimensions, particularly as those kinds of less-point and multi-sample profiles, together with unavoidable measurement noises, etc. Thus, any suitable pre-processing is demanded for the kinds of subjects before further analysis. The indispensable pre-processing covers de-noise treatments, functional and hierarchical clustering and so forth, before the next-stage network reconstruction.
The second concern mainly relates to the biologically-functional analysis on relative network modules and motifs by quantitative means. The proposed framework deciphers genetic regulatory activities with a rich-information mode. Thus, the inference results and related information between pairwise candidates have the potentials for those applications as succeeding identification of biological modules and motifs of particular interests.
The third focus might go to topological properties of inferred regulatory networks. Quantitative analysis and comparison between diverse constructed topologies might reveal inherent coordination and organization mechanisms, which thus have potential applications in, to name a few, identifying target genes, and novel drug discovery, particularly for those subjects in computational systems biology.
Conclusions
Within the work, we propose a combinatorial theory-based learning pattern for the inference and analysis of genetic networks from microarray time-series datasets.
For different kinds of microarray datasets gathered from multiple organisms and species, there still does not exist such an efficient solution applicable to most of current problems facing biological theoreticians and experimentalists. In consideration of previously-acquired knowledge, decision-makers’ preferences and practical constraints, the network inference might be transformed into a kind of multi-objective combinatorial optimization (MOCO) problem.
Compared with currently available methods for inferring biochemical networks [20, 21], the proposed approach renders the possibilities for biologists to incorporate concrete theoretic and empirical knowledge, and thus to construct regulatory networks with much more reliabilities and accuracy. Secondly, different regulatory models should focus on specific perspectives and utilities adopted by the builders, thus the inherent complexity from the inference procedures and the necessity to optimize those results appeal such a kind of associative relevance metrics and multiobjective combinatorial optimization method.
To include specific nodes into or exclude them from reconstructed networks with sufficient confidence and previously-acquired knowledge, there exists several design approaches for such purposes within the proposed framework. Within the work, we decipher the underlying design mechanisms of pairwise connectivity via dynamic threshold of linear/nonlinear relevance metrics, i.e. mutual information, correlation coefficient, and P-value; and determine regulatory orientations among genetic networks with signal processing metrics, i.e. phase shift and transfer gain.
With the inference procedure being transposed into a kind of MOCO problem, we might constrain the multiobjective iterative searching problems with reasonable terms from acquired knowledge, experimental conditions, and other computational considerations or decision-makers’ preferences.
We utilize the proposed method in analyzing two microarray datasets with different statistical characteristics. Thus by quantitative means, we reveal the inherent design mechanisms for genetic networks, facilitating the further theoretic analysis and experimental design with diverse biochemical aims.
For the sake of simplicity, we testify the proposed approach on a few small-scale datasets; different clustering and classification methods are beneficial and necessary as pre-process purposes on some large-scale, say more than hundreds or thousands of gene/proteins within those kinds of datasets.
Methods
Based on probability and signal processing theories, the following section introduces a dimensionless metric for regulatory strengths and a phase-shift metric for determining regulatory orientations. For network inference, we propose a combinatorial-optimization framework for constraining the inference complexities. The framework allows the possibility of incorporating acquired knowledge and specific aims for integrative mining and analysis.
Probability theory-based inference of biological network structures
where cov indicates covariance, E is the expected value operator, μ_{ X } = E(X), and σ_{ X }^{2} = E[(X-E(X))^{2}]=E(X^{2})-E^{2}(X).
When interpreting the Pearson product-moment correlation coefficient, Cohen noted that the proposed interpretative criteria were arbitrary in general and that specific treatments should be adopted for specific cases in those ranging from physics to other social sciences [22]. Apart from the parametric statistic, nonparametric correlation metrics such as the χ^{2} test, Spearman’s ρ, and Kendall’s τ are proposed, and those metrics can be applied to problems of diverse nonnormal distributions [23].
Information-theoretic inference of biological network structures
where p(x, y) denotes the joint probability distribution of X and Y, and p_{1}(x) and p_{2}(y) represents the marginal probability distributions of X and Y respectively. The measure normally adopts the well-defined form I(X, Y, b), where b denotes the base. In general, a base of 2 can be specified since that is the common unit of the bit. Thus, for analysis within this context, we consistently use the base of 2.
Associativity measure for describing regulatory connectivity
where MI_{ i }and Cor_{ i }denote the mutual information and correlation quantities respectively; ω_{ i }_{1}ω_{ i }_{2}represent the weights of both quantities; α_{ i }is the phase difference for the i th pair candidate; and N is a set of natural numbers. Note that the weights here aim to leverage any possible asymmetric distribution within the datasets of the above subterms MI_{ i }and Cor_{ i }. The weights can be derived from previously-acquired knowledge or from a specific theoretical hypothesis, e.g. the respective centroids of datasets.
Phase-shift metric for determining regulatory directions
Theoretically, the TP illustrates the phase shift between the investigated pairwise signals, i.e. the input and output. The phase shift ranges might be allocated within -π to π, where -π represents a phase lead of half a wavelength and π denotes a phase lag of half a wavelength. Whether the input signals are amplified or not is not illuminated at the output by the transfer gain and determines the related degrees at different frequencies. The larger the ratio, the less energy is lost by the output. Note that at different frequencies, the transfer phase and relative transfer gain might differ from each other. An effective evaluation criterion for these metrics is the related coherence, namely, at frequencies where the coherence values are high, the corresponding transfer phases and gains are much more reliable than others.
The advantages of such metrics lie in the flexible and quantitative characteristics of determining the regulatory delay via dynamic threshold. Factual regulatory mechanisms have multiple possibilities, and inherent regulatory delay effects might vary during the whole biological processes. The phase-shift metric determines such possibilities underlying regulatory mechanisms in a quantitative manner. The advantages include the inherent capabilities of integrating a priori biological knowledge. This kind of knowledge-based inference method avoids redundant false-positive connectivities within pairwise candidates.
Such dynamic threshold is applicable to the majority of problems facing theoretical and experimental biologists. Since regulatory connectivity underlying pairwise candidates may differ in diverse processes or at different sampling times, systematic and quantitative determination of these regulations with empirical and theoretical knowledge will be much more effective than those generated by most currently-available computational approaches [17]. Such types of flexible network connectivities and regulations characterize major regulatory processes from the perspectives of information and signal processing theories.
A MOCO pattern for constraining computational complexities
- (1)
Authentic Pairwise Genes (APGs): These include pairs with mutual information values and correlation coefficients larger than specific thresholds. Moreover, the corresponding P value resides in the confidence interval, namely, smaller than 0.05.
- (2)
Questionable Pairwise Genes (QPGs): These include pairs that do not satisfy both of the thresholds mentioned above. The group contains pairs of two classes. One class has pairs with mutual information larger than specific thresholds but satisfies neither the criteria of correlation coefficients nor P values. The other class includes pairs with correlation coefficients larger than specific thresholds and with P values residing in the confidence interval but the related mutual information does not satisfy specific thresholds.
- (3)
Unauthentic Pairwise Genes (UPGs): These include those pair candidates that do not satisfy any criteria of the APGs or QPGs defined above.
Algorithm: Pairwise Gene Hierarchy Criterion
Input: |
all pairwise gene candidates GPs; initial MI threshold MIth = MI's centroid; initial CC threshold CCth = CC's centroid; increments δ_{mi}, δ_{cc} for MI and CC. |
Output: |
classified APGs, UPGs and QPGs. |
while count(GPs)>0 do |
1. construct APGs, QPGs using initial MIth, CCth and P-value; 2. group the others into UPGs; if (APGs' undersized) && count(QPGs)>0 then do |
MIth=MIth-δ_{mi} & CCth=CCth-δ_{cc}; continue Step 1 for QPGs & obtain Δ_{APGs} and Δ_{UPGs}; APG=APGs+Δ_{APGs} & UPGs=UPGs-Δ_{UPGs}. |
elseif(APGs' oversized) then do |
MIth=MIth-δ_{mi} & CCth=CCth+δ_{cc}; continue Step 1 for APGs & obtain Δ_{APGs} and Δ_{UPGs}; APG=APGs-Δ_{APGs} & UPGs=UPGs+Δ_{APGs}. |
endif |
end |
where F_{ i }is the multiobjective function set; S_{1}is the set of feasible group combinations for APGs, QPGs, and UPGs; S_{2}is the number set of all gene pairs (S_{ 2 } = {n(n-1) / 2}, n is the total number of genes); S_{3}is the set of necessary gain constraints (GC); and S_{4}is the set of possible constraints from acquired biological knowledge (ABK).
Recently quite a few authors have argued the necessity of incorporating the preferences of decision-makers (DM) into MOCO solution selection [27–29]. For the problem under investigation, the DM’s preferences mainly stem from the GC (S_{3}) and ABK (S_{4}) illustrated above.
In cases governed by lower thresholds of mutual information and correlation metrics, APGs will form the group with the maximum components within the total pair candidates. On the other hand, with the heightened thresholds, many more pairs might be grouped into UPGs. This reduces the computational complexity for network reconstruction since APGs have fewer components in such situations. If APGs are classified with above-normal sizes, the reconstructed network will be densely connected and will have much more redundancies. On the contrary, a sparsely connected structure will be inferred with an undersized candidate group of APGs.
Since biological theoreticians and experimentalists may vary specific mutual information and correlation thresholds to incorporate empirical or concrete knowledge into the reconstruction procedures, the underlying coordination approaches via the MOCO framework might be feasible and significant, especially for those containing pivotal structural connectivity or for specific analysis purposes.
Declarations
Acknowledgements
This research work has been supported in part by the National 973 Program of China (No. 2007CB947002) and the Postgraduate Innovation Fund of Tongji University.
This article has been published as part of BMC Systems Biology Volume 4 Supplement 2, 2010: Selected articles from the Third International Symposium on Optimization andSystems Biology. The full contents of the supplement are available online at http://www.biomedcentral.com/1752-0509/4?issue=S2
Authors’ Affiliations
References
- Shmulevich I, Gluhovsky I, Hashimoto RF, Dougherty ER, Zhang W: Steady-state analysis of genetic regulatory networks modelled by probabilistic Boolean networks. Comparative and Functional Genomics. 2003, 4 (6): 601-608. 10.1002/cfg.342PubMedPubMed CentralView ArticleGoogle Scholar
- Faure A, Naldi A, Chaouiya C, Thieffry D: Dynamical analysis of a generic Boolean model for the control of the mammalian cell cycle. Bioinformatics. 2006, 22 (14): e124-131. 10.1093/bioinformatics/btl210PubMedView ArticleGoogle Scholar
- Garg A, Di Cara A, Xenarios I, Mendoza L, De Micheli G: Synchronous versus asynchronous modeling of gene regulatory networks. Bioinformatics. 2008, 24 (17): 1917-1925. 10.1093/bioinformatics/btn336PubMedPubMed CentralView ArticleGoogle Scholar
- Faryabi B, Vahedi G, Chamberland J-F, Datta A, Dougherty ER: Optimal constrained stationary intervention in gene regulatory networks. EURASIP Journal on Bioinformatics and Systems Biology. 2008Google Scholar
- Ching WK, Zhang SQ, Jiao Y, Akutsu T, Tsing NK, Wong AS: Optimal control policy for probabilistic Boolean networks with hard constraints. Systems Biology, IET. 2009, 3 (2): 90-99. 10.1049/iet-syb.2008.0120.View ArticleGoogle Scholar
- Zou M, Conzen SD: A new dynamic Bayesian network (DBN) approach for identifying gene regulatory networks from time course microarray data. Bioinformatics. 2005, 21 (1): 71-79. 10.1093/bioinformatics/bth463PubMedView ArticleGoogle Scholar
- de Hoon M, Imoto S, Kobayashi K, Ogasawara N, Miyano S: Inferring gene regulatory networks from time-ordered gene expression data of Bacillus subtilis using differential equations. Pac Symp Biocomput. 2003, 17-28.Google Scholar
- Perkins TJ, Hallett M, Glass L: Inferring models of gene expression dynamics. Journal of Theoretical Biology. 2004, 230 (3): 289-299. 10.1016/j.jtbi.2004.05.022PubMedView ArticleGoogle Scholar
- Tiana G, Krishna S, Pigolotti S, Jensen MH, Sneppen K: Oscillations and temporal signalling in cells. Physical Biology. 2007, 4 (2): R1-R17. 10.1088/1478-3975/4/2/R01PubMedView ArticleGoogle Scholar
- Wang Y, Joshi T, Zhang X-S, Xu D, Chen L: Inferring gene regulatory networks from multiple microarray datasets. Bioinformatics. 2006, 22 (19): 2413-2420. 10.1093/bioinformatics/btl396PubMedView ArticleGoogle Scholar
- Schneidman E, Still S, II MJB, Bialek W: Network information and connected correlations. Phys Rev Lett. 2003, 91 (23): 238701-238704.PubMedView ArticleGoogle Scholar
- Meyer PE, Kontos K, Lafitte F, Bontempi G: Information-theoretic inference of large transcriptional regulatory networks. EURASIP Journal on Bioinformatics and Systems Biology. 2007Google Scholar
- Zhao W, Serpedin E, Dougherty ER: Inferring connectivity of genetic regulatory networks using information-theoretic criteria. IEEE/ACM Trans Comput Biol Bioinformatics. 2008, 5 (2): 262-274.View ArticleGoogle Scholar
- Huber W, Carey V, Long L, Falcon S, Gentleman R: Graphs in molecular biology. BMC Bioinformatics. 2007, 8 (Suppl 6): S8- 10.1186/1471-2105-8-S6-S8PubMedPubMed CentralView ArticleGoogle Scholar
- Christensen C, Thakar J, Albert R: Systems-level insights into cellular regulation: inferring, analysing, and modelling intracellular networks. Systems Biology, IET. 2007, 1 (2): 61-77. 10.1049/iet-syb:20060071.View ArticleGoogle Scholar
- Tang B, He L, Jing Q, Shen B: Model-based identification & adaptive control of the core module in a typical cell cycle pathway via network and system control theories. Advances in Complex Systems. 2009, 12 (1): 21-43. 10.1142/S0219525909002076.View ArticleGoogle Scholar
- Butte AJ, Bao L, Reis BY, Watkins TW, Kohane IS: Comparing the similarity of time-series gene expression using signal processing metrics. Journal of Biomedical Informatics. 2001, 34 (6): 396-405. 10.1006/jbin.2002.1037PubMedView ArticleGoogle Scholar
- Dougherty ER, Shmulevich I, Bittner ML: Genomic signal processing: the salient issues. EURASIP J Appl Signal Process. 2004, (1): 146-153.
- Candy JV: Model-based signal processing. 2006, Hoboken, New Jersey: John Wiley & Sons, IncGoogle Scholar
- Barenco M, Tomescu D, Brewer D, Callard R, Stark J, Hubank M: Ranked prediction of p53 targets using hidden variable dynamic modeling. Genome Biology. 2006, 7 (3): R25- 10.1186/gb-2006-7-3-r25PubMedPubMed CentralView ArticleGoogle Scholar
- Chu L-H, Chen B-S: Comparisons of robustness and sensitivity between cancer and normal cells by microarray data. Cancer Informatics. 2008, 4: 165-181.Google Scholar
- Papoulis A: Probability, random variables, and stochastic processes. 1984, New York: McGraw-Hill, 2Google Scholar
- Cohen J: Statistical power analysis for the behavioral sciences. 1988, Hillsdale, New Jersey: Lawrence Erlbaum Associates, 2Google Scholar
- Simon MK: Probability distributions involving Gaussian random variables. 2002, New York: SpringerGoogle Scholar
- Yao YY: Information-theoretic measures for knowledge discovery and data mining. Entropy Measures, Maximum Entropy Principle and Emerging Applications. Edited by: Karmeshu. 2003, 115-136. SpringerView ArticleGoogle Scholar
- Forst CV, Schulten K: Phylogenetic analysis of metabolic pathways. Journal of Molecular Evolution. 2001, 52 (6): 471-489.PubMedView ArticleGoogle Scholar
- Jaszkiewicz A: Genetic local search for multi-objective combinatorial optimization. European Journal of Operational Research. 2002, 137 (1): 50-71. 10.1016/S0377-2217(01)00104-7.View ArticleGoogle Scholar
- Liefooghe A, Basseur M, Jourdan L, Talbi E-G: Combinatorial optimization of stochastic multi-objective problems: an application to the flow-shop scheduling problem. Evolutionary Multi-Criterion Optimization. 2007, 457-471.View ArticleGoogle Scholar
- Köksalan M: Multiobjective combinatorial optimization: some approaches. Journal of Multi-Criteria Decision Analysis. 2009, 15 (3-4): 69-78.View ArticleGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.