Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Bioinformatics Research and Applications [[electronic resource] ] : 13th International Symposium, ISBRA 2017, Honolulu, HI, USA, May 29 – June 2, 2017, Proceedings / / edited by Zhipeng Cai, Ovidiu Daescu, Min Li
| Bioinformatics Research and Applications [[electronic resource] ] : 13th International Symposium, ISBRA 2017, Honolulu, HI, USA, May 29 – June 2, 2017, Proceedings / / edited by Zhipeng Cai, Ovidiu Daescu, Min Li |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (LXVIII, 433 p. 141 illus.) |
| Disciplina | 572.80285 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Bioinformatics
Biomathematics Data mining Pattern recognition Bioinformatics Computational biology Computational Biology/Bioinformatics Mathematical and Computational Biology Data Mining and Knowledge Discovery Pattern Recognition Computer Appl. in Life Sciences |
| ISBN | 3-319-59575-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Biomarker discovery -- Biomedical databases and data integration -- Biomedical text mining and ortologies -- Biomolecular imaging -- Comparative genomics -- Computational genetic epidemiology -- Computational proteomics -- Data mining and visualization -- Gene expression analysis -- Genome analysis -- High-performance bio-computing -- Metagenomics -- Molecular evolution -- Molecular modelling and simulation -- Next-generation sequencing data analysis -- Pattern discovery and classification -- Population genetics -- Software tools and applications -- Structural biology -- Systems biology. |
| Record Nr. | UNISA-996466183803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Bioinformatics Research and Applications : 13th International Symposium, ISBRA 2017, Honolulu, HI, USA, May 29 – June 2, 2017, Proceedings / / edited by Zhipeng Cai, Ovidiu Daescu, Min Li
| Bioinformatics Research and Applications : 13th International Symposium, ISBRA 2017, Honolulu, HI, USA, May 29 – June 2, 2017, Proceedings / / edited by Zhipeng Cai, Ovidiu Daescu, Min Li |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (LXVIII, 433 p. 141 illus.) |
| Disciplina | 572.80285 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Bioinformatics
Biomathematics Data mining Pattern recognition Bioinformatics Computational biology Computational Biology/Bioinformatics Mathematical and Computational Biology Data Mining and Knowledge Discovery Pattern Recognition Computer Appl. in Life Sciences |
| ISBN | 3-319-59575-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Biomarker discovery -- Biomedical databases and data integration -- Biomedical text mining and ortologies -- Biomolecular imaging -- Comparative genomics -- Computational genetic epidemiology -- Computational proteomics -- Data mining and visualization -- Gene expression analysis -- Genome analysis -- High-performance bio-computing -- Metagenomics -- Molecular evolution -- Molecular modelling and simulation -- Next-generation sequencing data analysis -- Pattern discovery and classification -- Population genetics -- Software tools and applications -- Structural biology -- Systems biology. |
| Record Nr. | UNINA-9910483174703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Optimization and Applications [[electronic resource] ] : 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II / / edited by Weili Wu, Ovidiu Daescu
| Combinatorial Optimization and Applications [[electronic resource] ] : 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II / / edited by Weili Wu, Ovidiu Daescu |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XVI, 416 p. 80 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer networks Computer graphics Bioinformatics Discrete Mathematics in Computer Science Computer Communication Networks Computer Graphics Computational and Systems Biology Symbolic and Algebraic Manipulation |
| ISBN |
1-280-39058-1
9786613568502 3-642-17461-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Coverage with k-Transmitters in the Presence of Obstacles -- On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem -- Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations -- Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks -- Time Optimal Algorithms for Black Hole Search in Rings -- Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle -- A Constant-Factor Approximation Algorithm for the Link Building Problem -- XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme -- Computational Study for Planar Connected Dominating Set Problem -- Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives -- A Search-Based Approach to the Railway Rolling Stock Allocation Problem -- Approximation Algorithm for the Minimum Directed Tree Cover -- An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs -- A New Result on [k,k?+?1]-Factors Containing Given Hamiltonian Cycles -- Yao Graphs Span Theta Graphs -- A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time -- New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs -- A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem -- Fast Edge-Searching and Related Problems -- Diameter-Constrained Steiner Tree -- Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks -- A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree -- Constrained Low-Interference Relay Node Deployment for Underwater Acoustic Wireless Sensor Networks -- Structured Overlay Network for File Distribution -- Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations -- The Networked Common Goods Game -- A Novel Branching Strategy for Parameterized Graph Modification Problems -- Listing Triconnected Rooted Plane Graphs -- Bipartite Permutation Graphs Are Reconstructible -- A Transformation from PPTL to S1S -- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs -- Approximate Ellipsoid in the Streaming Model. |
| Record Nr. | UNISA-996466006003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Optimization and Applications [[electronic resource] ] : 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I / / edited by Weili Wu, Ovidiu Daescu
| Combinatorial Optimization and Applications [[electronic resource] ] : 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I / / edited by Weili Wu, Ovidiu Daescu |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XV, 424 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer networks Computer graphics Bioinformatics Discrete Mathematics in Computer Science Computer Communication Networks Computer Graphics Computational and Systems Biology Symbolic and Algebraic Manipulation |
| ISBN |
1-280-39057-3
9786613568496 3-642-17458-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Termination of Multipartite Graph Series Arising from Complex Network Modelling -- Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids -- Evacuation of Rectilinear Polygons -- A Fast Algorithm for Powerful Alliances in Trees -- NP-Completeness of Spreading Colored Points -- Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach -- Feasibility-Based Bounds Tightening via Fixed Points -- A Characterisation of Stable Sets in Games with Transitive Preference -- Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering -- An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations -- Bases of Primitive Nonpowerful Sign Patterns -- Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures -- Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets -- Finding Strong Bridges and Strong Articulation Points in Linear Time -- Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks -- An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs -- On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs -- Cyclic Vertex Connectivity of Star Graphs -- The Number of Shortest Paths in the (n, k)-Star Graphs -- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems -- PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks -- A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSP -- Computing Toolpaths for 5-Axis NC Machines -- A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs -- A Randomized Algorithm for Weighted Approximation of Points by a Step Function -- Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials -- The Union of Colorful Simplices Spanned by a Colored Point Set -- Compact Visibility Representation of 4-Connected Plane Graphs -- Some Variations on Constrained Minimum Enclosing Circle Problem -- Searching for an Axis-Parallel Shoreline -- Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs -- Scheduling Packets with Values and Deadlines in Size-Bounded Buffers -- Transporting Jobs through a Processing Center with Two Parallel Machines. |
| Record Nr. | UNISA-996466005703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Optimization and Applications : 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I / / edited by Weili Wu, Ovidiu Daescu
| Combinatorial Optimization and Applications : 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I / / edited by Weili Wu, Ovidiu Daescu |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XV, 424 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer networks Computer graphics Bioinformatics Discrete Mathematics in Computer Science Computer Communication Networks Computer Graphics Computational and Systems Biology Symbolic and Algebraic Manipulation |
| ISBN |
1-280-39057-3
9786613568496 3-642-17458-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Termination of Multipartite Graph Series Arising from Complex Network Modelling -- Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids -- Evacuation of Rectilinear Polygons -- A Fast Algorithm for Powerful Alliances in Trees -- NP-Completeness of Spreading Colored Points -- Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach -- Feasibility-Based Bounds Tightening via Fixed Points -- A Characterisation of Stable Sets in Games with Transitive Preference -- Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering -- An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations -- Bases of Primitive Nonpowerful Sign Patterns -- Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures -- Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets -- Finding Strong Bridges and Strong Articulation Points in Linear Time -- Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks -- An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs -- On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs -- Cyclic Vertex Connectivity of Star Graphs -- The Number of Shortest Paths in the (n, k)-Star Graphs -- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems -- PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks -- A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSP -- Computing Toolpaths for 5-Axis NC Machines -- A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs -- A Randomized Algorithm for Weighted Approximation of Points by a Step Function -- Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials -- The Union of Colorful Simplices Spanned by a Colored Point Set -- Compact Visibility Representation of 4-Connected Plane Graphs -- Some Variations on Constrained Minimum Enclosing Circle Problem -- Searching for an Axis-Parallel Shoreline -- Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs -- Scheduling Packets with Values and Deadlines in Size-Bounded Buffers -- Transporting Jobs through a Processing Center with Two Parallel Machines. |
| Record Nr. | UNINA-9910484541503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Optimization and Applications : 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II / / edited by Weili Wu, Ovidiu Daescu
| Combinatorial Optimization and Applications : 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II / / edited by Weili Wu, Ovidiu Daescu |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XVI, 416 p. 80 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer networks Computer graphics Bioinformatics Discrete Mathematics in Computer Science Computer Communication Networks Computer Graphics Computational and Systems Biology Symbolic and Algebraic Manipulation |
| ISBN |
1-280-39058-1
9786613568502 3-642-17461-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Coverage with k-Transmitters in the Presence of Obstacles -- On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem -- Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations -- Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks -- Time Optimal Algorithms for Black Hole Search in Rings -- Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle -- A Constant-Factor Approximation Algorithm for the Link Building Problem -- XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme -- Computational Study for Planar Connected Dominating Set Problem -- Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives -- A Search-Based Approach to the Railway Rolling Stock Allocation Problem -- Approximation Algorithm for the Minimum Directed Tree Cover -- An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs -- A New Result on [k,k?+?1]-Factors Containing Given Hamiltonian Cycles -- Yao Graphs Span Theta Graphs -- A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time -- New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs -- A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem -- Fast Edge-Searching and Related Problems -- Diameter-Constrained Steiner Tree -- Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks -- A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree -- Constrained Low-Interference Relay Node Deployment for Underwater Acoustic Wireless Sensor Networks -- Structured Overlay Network for File Distribution -- Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations -- The Networked Common Goods Game -- A Novel Branching Strategy for Parameterized Graph Modification Problems -- Listing Triconnected Rooted Plane Graphs -- Bipartite Permutation Graphs Are Reconstructible -- A Transformation from PPTL to S1S -- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs -- Approximate Ellipsoid in the Streaming Model. |
| Record Nr. | UNINA-9910484686303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||