Experimental Algorithms [[electronic resource] ] : 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings / / edited by Paola Festa |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XII, 514 p. 126 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Algorithms Artificial intelligence Application software Computer networks Information storage and retrieval systems Programming Techniques Artificial Intelligence Computer and Information Systems Applications Computer Communication Networks Information Storage and Retrieval |
ISBN | 3-642-13193-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Experimental Study of Resilient Algorithms and Data Structures -- Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs -- Contributed Regular Papers -- Alternative Routes in Road Networks -- Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks -- Space-Efficient SHARC-Routing -- A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation -- Contraction of Timetable Networks with Realistic Transfers -- Distributed Time-Dependent Contraction Hierarchies -- Practical Compressed Suffix Trees -- Maximum Cliques in Protein Structure Comparison -- Exact Bipartite Crossing Minimization under Tree Constraints -- Bit-Parallel Search Algorithms for Long Patterns -- Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments -- Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars -- Time-Dependent Contraction Hierarchies and Approximation -- A New Combinational Logic Minimization Technique with Applications to Cryptology -- Randomized Rounding for Routing and Covering Problems: Experiments and Improvements -- The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm -- An Approximate ?-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem -- A Branch-and-Price Algorithm for Multi-mode Resource Leveling -- Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs -- Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem -- Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation -- New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery -- A Metaheuristic for a Two Echelon Location-Routing Problem -- New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint -- An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem -- An Analysis of Heuristics for Vertex Colouring -- Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm -- Experiments with a Feasibility Pump Approach for Nonconvex MINLPs -- Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems -- Realtime Classification for Encrypted Traffic -- Data Propagation with Guaranteed Delivery for Mobile Networks -- Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries -- Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure -- Policy-Based Benchmarking of Weak Heaps and Their Relatives, -- Modularity-Driven Clustering of Dynamic Graphs -- Gateway Decompositions for Constrained Reachability Problems -- Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere -- Fault Recovery in Wireless Networks: The Geometric Recolouring Approach -- Geometric Minimum Spanning Trees with GeoFilterKruskal -- Practical Nearest Neighbor Search in the Plane. |
Record Nr. | UNISA-996465328703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Experimental Algorithms [[electronic resource] ] : 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings / / edited by Paola Festa |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XII, 514 p. 126 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Algorithms Artificial intelligence Application software Computer networks Information storage and retrieval systems Programming Techniques Artificial Intelligence Computer and Information Systems Applications Computer Communication Networks Information Storage and Retrieval |
ISBN | 3-642-13193-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Experimental Study of Resilient Algorithms and Data Structures -- Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs -- Contributed Regular Papers -- Alternative Routes in Road Networks -- Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks -- Space-Efficient SHARC-Routing -- A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation -- Contraction of Timetable Networks with Realistic Transfers -- Distributed Time-Dependent Contraction Hierarchies -- Practical Compressed Suffix Trees -- Maximum Cliques in Protein Structure Comparison -- Exact Bipartite Crossing Minimization under Tree Constraints -- Bit-Parallel Search Algorithms for Long Patterns -- Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments -- Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars -- Time-Dependent Contraction Hierarchies and Approximation -- A New Combinational Logic Minimization Technique with Applications to Cryptology -- Randomized Rounding for Routing and Covering Problems: Experiments and Improvements -- The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm -- An Approximate ?-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem -- A Branch-and-Price Algorithm for Multi-mode Resource Leveling -- Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs -- Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem -- Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation -- New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery -- A Metaheuristic for a Two Echelon Location-Routing Problem -- New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint -- An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem -- An Analysis of Heuristics for Vertex Colouring -- Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm -- Experiments with a Feasibility Pump Approach for Nonconvex MINLPs -- Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems -- Realtime Classification for Encrypted Traffic -- Data Propagation with Guaranteed Delivery for Mobile Networks -- Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries -- Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure -- Policy-Based Benchmarking of Weak Heaps and Their Relatives, -- Modularity-Driven Clustering of Dynamic Graphs -- Gateway Decompositions for Constrained Reachability Problems -- Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere -- Fault Recovery in Wireless Networks: The Geometric Recolouring Approach -- Geometric Minimum Spanning Trees with GeoFilterKruskal -- Practical Nearest Neighbor Search in the Plane. |
Record Nr. | UNINA-9910484653303321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Hybrid Metaheuristics [[electronic resource] ] : 8th International Workshop, HM 2013, Ischia, Italy, May 23-25, 2013. Proceedings / / edited by Maria J. Blesa, Christian Blum, Paola Festa, Andrea Roli, Michael Sampels |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (X, 213 p. 41 illus.) |
Disciplina | 006.3 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Artificial intelligence
Numerical analysis Algorithms Computer science Artificial Intelligence Numerical Analysis Theory of Computation |
ISBN | 3-642-38516-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996466288803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Hybrid Metaheuristics [[electronic resource] ] : 8th International Workshop, HM 2013, Ischia, Italy, May 23-25, 2013. Proceedings / / edited by Maria J. Blesa, Christian Blum, Paola Festa, Andrea Roli, Michael Sampels |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (X, 213 p. 41 illus.) |
Disciplina | 006.3 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Artificial intelligence
Numerical analysis Algorithms Computer science Artificial Intelligence Numerical Analysis Theory of Computation |
ISBN | 3-642-38516-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910483990403321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Learning and Intelligent Optimization [[electronic resource] ] : 10th International Conference, LION 10, Ischia, Italy, May 29 -- June 1, 2016, Revised Selected Papers / / edited by Paola Festa, Meinolf Sellmann, Joaquin Vanschoren |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XI, 309 p. 74 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science Artificial intelligence Computer science—Mathematics Discrete mathematics Computer simulation Computer Science Logic and Foundations of Programming Artificial Intelligence Discrete Mathematics in Computer Science Theory of Computation Computer Modelling |
ISBN | 3-319-50349-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Learning a stopping criteria for Local Search -- Surrogate Assisted Feature Computation for Continuous Problems -- MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework -- Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers -- Extreme Reactive Portfolio (XRP): Tuning an Algorithm Population for Global Optimization -- Bounding the Search Space of the Population Harvest Cutting Problem with Multiple Size Stock Selection -- Designing and comparing multiple portfolios of parameter configurations for online algorithm selection -- Portfolios of Subgraph Isomorphism Algorithms -- Structure-preserving Instance Generation -- Feature Selection using Tabu Search with Learning Memory: Learning Tabu Search -- The Impact of Automated Algorithm Configuration on the Scaling Behaviour of State-of-the-art Inexact TSP Solvers -- Requests Management for Smartphone-based Matching Applications using a Multi-Agent Approach -- Self-Organizing Neural Network for Adaptive Operator Selection in Evolutionary Search -- Quantifying the Similarity of Algorithm Configurations -- Neighborhood synthesis from an ensemble of MIP and CP models -- Parallelizing Constraint Solvers for Hard RCPSP Instances -- Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm -- Constraint Programming and Machine Learning for Interactive Soccer Analysis -- A Matheuristic Approach for the p-Cable Trench Problem -- An Empirical Study of Per-Instance Algorithm Scheduling -- Dynamic strategy to diversify search using history map in parallel solving -- Faster Model Based Optimization through Resource Aware Scheduling Strategies -- Risk-Averse Anticipation for Dynamic Vehicle Routing -- Solving GENOPT problems with the use of ExaMin solver -- Hybridisation of Evolutionary Algorithms through Hyper-heuristics for Global Continuous Optimisation. |
Record Nr. | UNISA-996465494403316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Learning and Intelligent Optimization [[electronic resource] ] : 10th International Conference, LION 10, Ischia, Italy, May 29 -- June 1, 2016, Revised Selected Papers / / edited by Paola Festa, Meinolf Sellmann, Joaquin Vanschoren |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XI, 309 p. 74 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science Artificial intelligence Computer science—Mathematics Discrete mathematics Computer simulation Computer Science Logic and Foundations of Programming Artificial Intelligence Discrete Mathematics in Computer Science Theory of Computation Computer Modelling |
ISBN | 3-319-50349-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Learning a stopping criteria for Local Search -- Surrogate Assisted Feature Computation for Continuous Problems -- MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework -- Evolving Instances for Maximizing Performance Differences of State-of-The-Art Inexact TSP Solvers -- Extreme Reactive Portfolio (XRP): Tuning an Algorithm Population for Global Optimization -- Bounding the Search Space of the Population Harvest Cutting Problem with Multiple Size Stock Selection -- Designing and comparing multiple portfolios of parameter configurations for online algorithm selection -- Portfolios of Subgraph Isomorphism Algorithms -- Structure-preserving Instance Generation -- Feature Selection using Tabu Search with Learning Memory: Learning Tabu Search -- The Impact of Automated Algorithm Configuration on the Scaling Behaviour of State-of-the-art Inexact TSP Solvers -- Requests Management for Smartphone-based Matching Applications using a Multi-Agent Approach -- Self-Organizing Neural Network for Adaptive Operator Selection in Evolutionary Search -- Quantifying the Similarity of Algorithm Configurations -- Neighborhood synthesis from an ensemble of MIP and CP models -- Parallelizing Constraint Solvers for Hard RCPSP Instances -- Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm -- Constraint Programming and Machine Learning for Interactive Soccer Analysis -- A Matheuristic Approach for the p-Cable Trench Problem -- An Empirical Study of Per-Instance Algorithm Scheduling -- Dynamic strategy to diversify search using history map in parallel solving -- Faster Model Based Optimization through Resource Aware Scheduling Strategies -- Risk-Averse Anticipation for Dynamic Vehicle Routing -- Solving GENOPT problems with the use of ExaMin solver -- Hybridisation of Evolutionary Algorithms through Hyper-heuristics for Global Continuous Optimisation. |
Record Nr. | UNINA-9910484319303321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Metaheuristics for string problems in bio-informatics / / Christian Blum, Paola Festa |
Autore | Blum C (Christian) |
Pubbl/distr/stampa | London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2016 |
Descrizione fisica | 1 online resource (232 p.) |
Disciplina | 572.80285 |
Collana | Computer Engineering Series |
Soggetto topico | Bioinformatics |
Soggetto genere / forma | Electronic books. |
ISBN |
1-119-13680-6
1-119-13679-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Cover ; Dedication; Title Page ; Copyright ; Contents; Preface; Acknowledgments; List of Acronyms; 1. Introduction; 1.1. Complete methods for combinatorial optimization; 1.1.1. Linear programming relaxation; 1.1.2. Cutting plane techniques; 1.1.3. General-purpose ILP solvers; 1.1.4. Dynamic programming; 1.2. Approximate methods: metaheuristics; 1.2.1. Ant colony optimization; 1.2.2. Evolutionary algorithms; 1.2.3. Greedy randomized adaptive search procedures; 1.2.4. Iterated local search; 1.2.5. Simulated annealing; 1.2.6. Other metaheuristics; 1.2.7. Hybrid approaches
1.3. Outline of the book2. Minimum Common String Partition Problem; 2.1. The MCSP problem; 2.1.1. Technical description of the UMCSP problem; 2.1.2. Literature review; 2.1.3. Organization of this chapter; 2.2. An ILP model for the UMCSP problem; 2.3. Greedy approach; 2.4. Construct, merge, solve and adapt; 2.5. Experimental evaluation; 2.5.1. Benchmarks; 2.5.2. Tuning CMSA; 2.5.3. Results; 2.6. Future work; 3. Longest Common Subsequence Problems; 3.1. Introduction; 3.1.1. LCS problems; 3.1.2. ILP models for LCS and RFLCS problems; 3.1.3. Organization of this chapter 3.2. Algorithms for the LCS problem 3.2.1. Beam search; 3.2.2. Upper bound; 3.2.3. Beam search framework; 3.2.4. Beam-ACO; 3.2.5. Experimental evaluation; 3.3. Algorithms for the RFLCS problem; 3.3.1. CMSA; 3.3.2. Experimental evaluation; 3.4. Future work; 4. The Most Strings With Few Bad Columns Problem; 4.1. The MSFBC problem; 4.1.1. Literature review; 4.2. An ILP model for the MSFBC problem; 4.3. Heuristic approaches; 4.3.1. Frequency-based greedy; 4.3.2. Truncated pilot method; 4.4. ILP-based large neighborhood search; 4.5. Experimental evaluation; 4.5.1. Benchmarks; 4.5.2. Tuning of LNS 4.5.3. Results4.6. Future work; 5. Consensus String Problems; 5.1. Introduction; 5.1.1. Creating diagnostic probes for bacterial infections; 5.1.2. Primer design; 5.1.3. Discovering potential drug targets; 5.1.4. Motif search; 5.2. Organization of this chapter; 5.3. The closest string problem and the close to most string problem; 5.3.1. ILP models for the CSP and the CTMSP; 5.3.2. Literature review; 5.3.3. Exact approaches for the CSP; 5.3.4. Approximation algorithms for the CSP; 5.3.5. Heuristics and metaheuristics for the CSP 5.4. The farthest string problem and the far from most string problem5.4.1. ILP models for the FSP and the FFMSP; 5.4.2. Literature review; 5.4.3. Heuristics and metaheuristics for the FFMSP; 5.5. An ILP-based heuristic; 5.6. Future work; 6. Alignment Problems; 6.1. Introduction; 6.1.1. Organization of this chapter; 6.2. The pairwise alignment problem; 6.2.1. Smith and Waterman's algorithm; 6.3. The multiple alignment problem; 6.3.1. Heuristics for the multiple alignment problem; 6.3.2. Metaheuristics for the multiple alignment problem; 6.4. Conclusion and future work; 7. Conclusions 7.1. DNA sequencing |
Record Nr. | UNINA-9910135017903321 |
Blum C (Christian)
![]() |
||
London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Metaheuristics for string problems in bio-informatics / / Christian Blum, Paola Festa |
Autore | Blum C (Christian) |
Pubbl/distr/stampa | London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2016 |
Descrizione fisica | 1 online resource (232 p.) |
Disciplina | 572.80285 |
Collana | Computer Engineering Series |
Soggetto topico | Bioinformatics |
ISBN |
1-119-13680-6
1-119-13679-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Cover ; Dedication; Title Page ; Copyright ; Contents; Preface; Acknowledgments; List of Acronyms; 1. Introduction; 1.1. Complete methods for combinatorial optimization; 1.1.1. Linear programming relaxation; 1.1.2. Cutting plane techniques; 1.1.3. General-purpose ILP solvers; 1.1.4. Dynamic programming; 1.2. Approximate methods: metaheuristics; 1.2.1. Ant colony optimization; 1.2.2. Evolutionary algorithms; 1.2.3. Greedy randomized adaptive search procedures; 1.2.4. Iterated local search; 1.2.5. Simulated annealing; 1.2.6. Other metaheuristics; 1.2.7. Hybrid approaches
1.3. Outline of the book2. Minimum Common String Partition Problem; 2.1. The MCSP problem; 2.1.1. Technical description of the UMCSP problem; 2.1.2. Literature review; 2.1.3. Organization of this chapter; 2.2. An ILP model for the UMCSP problem; 2.3. Greedy approach; 2.4. Construct, merge, solve and adapt; 2.5. Experimental evaluation; 2.5.1. Benchmarks; 2.5.2. Tuning CMSA; 2.5.3. Results; 2.6. Future work; 3. Longest Common Subsequence Problems; 3.1. Introduction; 3.1.1. LCS problems; 3.1.2. ILP models for LCS and RFLCS problems; 3.1.3. Organization of this chapter 3.2. Algorithms for the LCS problem 3.2.1. Beam search; 3.2.2. Upper bound; 3.2.3. Beam search framework; 3.2.4. Beam-ACO; 3.2.5. Experimental evaluation; 3.3. Algorithms for the RFLCS problem; 3.3.1. CMSA; 3.3.2. Experimental evaluation; 3.4. Future work; 4. The Most Strings With Few Bad Columns Problem; 4.1. The MSFBC problem; 4.1.1. Literature review; 4.2. An ILP model for the MSFBC problem; 4.3. Heuristic approaches; 4.3.1. Frequency-based greedy; 4.3.2. Truncated pilot method; 4.4. ILP-based large neighborhood search; 4.5. Experimental evaluation; 4.5.1. Benchmarks; 4.5.2. Tuning of LNS 4.5.3. Results4.6. Future work; 5. Consensus String Problems; 5.1. Introduction; 5.1.1. Creating diagnostic probes for bacterial infections; 5.1.2. Primer design; 5.1.3. Discovering potential drug targets; 5.1.4. Motif search; 5.2. Organization of this chapter; 5.3. The closest string problem and the close to most string problem; 5.3.1. ILP models for the CSP and the CTMSP; 5.3.2. Literature review; 5.3.3. Exact approaches for the CSP; 5.3.4. Approximation algorithms for the CSP; 5.3.5. Heuristics and metaheuristics for the CSP 5.4. The farthest string problem and the far from most string problem5.4.1. ILP models for the FSP and the FFMSP; 5.4.2. Literature review; 5.4.3. Heuristics and metaheuristics for the FFMSP; 5.5. An ILP-based heuristic; 5.6. Future work; 6. Alignment Problems; 6.1. Introduction; 6.1.1. Organization of this chapter; 6.2. The pairwise alignment problem; 6.2.1. Smith and Waterman's algorithm; 6.3. The multiple alignment problem; 6.3.1. Heuristics for the multiple alignment problem; 6.3.2. Metaheuristics for the multiple alignment problem; 6.4. Conclusion and future work; 7. Conclusions 7.1. DNA sequencing |
Record Nr. | UNINA-9910830894303321 |
Blum C (Christian)
![]() |
||
London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|