Artificial Evolution

This LNCS volume includes the best papers presented at the 11th Biennial International Conference on Artificial Evolution, EA 2 2013, held in Bordeaux (France). Authors had been invited to present original work relevant to Artificial Evolution, including, but not limited to: Evolutionary Computation, Evolutionary Optimization, Co-evolution, Artificial Life, Population Dynamics, Theory, Algorithmics and Modeling, Implementations, Application of Evolutionary Paradigms to the Real World(industry, biosciences,...), other Biologically Inspired Paradigms (Swarm, Artificial Ants, Artificial Immune Systems, Cultural Algorithms...), Memetic Algorithms, Multi-Objective Optimization, Constraint Handling, Parallel Algorithms, Dynamic Optimization, Machine Learning, and hybridization with other soft computing techniques

[1]  Sushmita Mitra,et al.  Multi-objective evolutionary biclustering of gene expression data , 2006, Pattern Recognit..

[2]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[3]  David Maier,et al.  The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.

[4]  Carlos Eduardo Ferreira,et al.  Repetition-free longest common subsequence , 2010, Discret. Appl. Math..

[5]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[6]  Sergio Gómez,et al.  Size reduction of complex networks preserving modularity , 2007, ArXiv.

[7]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[8]  Jure Leskovec,et al.  Friendship and mobility: user movement in location-based social networks , 2011, KDD.

[9]  A Díaz-Guilera,et al.  Self-similar community structure in a network of human interactions. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[11]  Christian Blum Beam-ACO for the longest common subsequence problem , 2010, IEEE Congress on Evolutionary Computation.

[12]  Jin-Kao Hao,et al.  A Memetic Algorithm for Community Detection in Complex Networks , 2012, PPSN.

[13]  Todd Easton,et al.  A large neighborhood search heuristic for the longest common subsequence problem , 2008, J. Heuristics.

[14]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[15]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[16]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[17]  Bryant A. Julstrom,et al.  Starting from Scratch: Growing Longest Common Subsequences with Evolution , 2006, PPSN.

[18]  Andreas Noack,et al.  Multi-level Algorithms for Modularity Clustering , 2008, SEA.

[19]  D. Bu,et al.  Topological structure analysis of the protein-protein interaction network in budding yeast. , 2003, Nucleic acids research.

[20]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[21]  A. Arenas,et al.  Models of social networks based on social distance attachment. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Bin Ma,et al.  A General Edit Distance between RNA Structures , 2002, J. Comput. Biol..

[23]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[24]  김동규,et al.  [서평]「Algorithms on Strings, Trees, and Sequences」 , 2000 .

[25]  Shyong Jian Shyu,et al.  Finding the longest common subsequence for multiple biological sequences by ant colony optimization , 2009, Comput. Oper. Res..

[26]  Chris Walshaw,et al.  Multilevel Refinement for Combinatorial Optimisation Problems , 2004, Ann. Oper. Res..

[27]  Paola Bonizzoni,et al.  Variants of constrained longest common subsequence , 2009, Inf. Process. Lett..