LEADER 03253nam 2200601Ia 450 001 9910830867203321 005 20170815113640.0 010 $a1-282-03426-X 010 $a9786612034268 010 $a0-470-74189-9 010 $a0-470-74190-2 035 $a(CKB)1000000000687275 035 $a(EBL)416483 035 $a(OCoLC)476248377 035 $a(SSID)ssj0000226366 035 $a(PQKBManifestationID)11210196 035 $a(PQKBTitleCode)TC0000226366 035 $a(PQKBWorkID)10259005 035 $a(PQKB)10144141 035 $a(MiAaPQ)EBC416483 035 $a(PPN)152528962 035 $a(EXLCZ)991000000000687275 100 $a20080912d2009 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aPrediction of protein structures, functions, and interactions$b[electronic resource] /$fedited by Janusz M. Bujnicki 210 $aChichester, U.K. $cWiley$d2009 215 $a1 online resource (306 p.) 300 $aDescription based upon print version of record. 311 $a0-470-51767-0 320 $aIncludes bibliographical references and index. 327 $aPrediction of Protein Structures, Functions, and Interactions; Contents; List of Contributors; Preface; 1 The Basics of Protein Sequence Analysis; 2 First Steps of Protein Structure Prediction; 3 Automated Prediction of Protein Function from Sequence; 4 Template Based Prediction of Three-dimensional Protein Structures: Fold Recognition and Comparative Modeling; 5 Template-free Predictions of Three-dimensional Protein Structures: From First Principles to Knowledge-based Potentials; 6 Quality Assessment of Protein Models 327 $a7 Prediction of Molecular Interactions from 3D-structures: From Small Ligands to Large Protein Complexes8 Structure-based Prediction of Enzymes and Their Active Sites; 9 The Prediction of Macromolecular Complexes by Docking; 10 Protein Function Prediction via Analysis of Interactomes; 11 Integrating Prediction of Structure, Function, and Interactions; Index; Color Plate 330 $aThe growing flood of new experimental data generated by genome sequencing has provided an impetus for the development of automated methods for predicting the functions of proteins that have been deduced by sequence analysis and lack experimental characterization. Prediction of Protein Structures, Functions and Interactions presents a comprehensive overview of methods for prediction of protein structure or function, with the emphasis on their availability and possibilities for their combined use. Methods of modeling of individual proteins, prediction of their interactions, and docking of comp 606 $aProteins$xStructures 606 $aAmino acid sequence 606 $aProtein-protein interactions 615 0$aProteins$xStructures. 615 0$aAmino acid sequence. 615 0$aProtein-protein interactions. 676 $a572.633 676 $a572/.633 701 $aBujnicki$b Janusz M$0731294 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910830867203321 996 $aPrediction of protein structures, functions, and interactions$94049994 997 $aUNINA LEADER 04993nam 2200673Ia 450 001 9910830225603321 005 20230801224901.0 010 $a1-118-44921-5 010 $a1-283-64484-3 010 $a1-118-44918-5 010 $a1-118-44924-X 035 $a(CKB)2670000000262611 035 $a(EBL)918281 035 $a(OCoLC)814389972 035 $a(SSID)ssj0000753940 035 $a(PQKBManifestationID)11496228 035 $a(PQKBTitleCode)TC0000753940 035 $a(PQKBWorkID)10710126 035 $a(PQKB)11189662 035 $a(MiAaPQ)EBC918281 035 $a(DLC) 2012043402 035 $a(EXLCZ)992670000000262611 100 $a20111102d2012 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aEquitable resource allocation$b[electronic resource] $emodels, algorithms and applications /$fHanan Luss 210 $aHoboken, NJ $cWiley$d2012 215 $a1 online resource (371 p.) 225 0 $aInformation and communication technology series 300 $aDescription based upon print version of record. 311 $a1-118-05468-7 320 $aIncludes bibliographical references and indexes. 327 $aTitle page; Copyright page; Contents; Preface; Acknowledgments; 1: Introduction; 1.1 Perspective; 1.2 Equitable Resource Allocation: Lexicographic Minimax (Maximin) Optimization; 1.3 Examples and Applications; 1.3.1 Allocation of High-Tech Components; 1.3.2 Throughput in Communication and Computer Networks; 1.3.3 Point-to-Point Throughput Estimation in Networks; 1.3.4 Bandwidth Allocation for Content Distribution; 1.3.5 Location of Emergency Facilities; 1.3.6 Other Applications; 1.4 Related Fairness Criteria; 1.5 Outline of the Book; 1.5.1 Chapter 2: Nonlinear Resource Allocation 327 $a1.5.2 Chapter 3: Equitable Resource Allocation: Lexicographic Minimax and Maximin Optimization1.5.3 Chapter 4: Equitable Resource Allocation with Substitutable Resources; 1.5.4 Chapter 5: Multiperiod Equitable Resource Allocation; 1.5.5 Chapter 6: Equitable Network Resource Allocation; 1.5.6 Chapter 7: Equitable Resource Allocation with Integer Decisions; 1.6 Concluding Remarks AND LITERATURE REVIEW; 1.6.1 Equitable Allocation of High-Tech Components; 1.6.2 Equitable Throughput in Communication and Computer Networks; 1.6.3 Point-to-Point Throughput Estimation in Networks 327 $a1.6.4 Equitable Bandwidth Allocation for Content Distribution1.6.5 Equitable Location of Emergency Facilities; 1.6.6 Other Applications; 2: Nonlinear Resource Allocation; 2.1 Formulation and Optimality Properties; 2.2 Algorithms; 2.2.1 The Activity Deletion Algorithm; 2.2.2 The Activity Addition Algorithm; 2.2.3 The Constraints Evaluation Algorithm; 2.2.4 Lower and Upper Bounds; 2.3 Nonlinear Resource-Usage Constraint; 2.3.1 Formulation and Optimality Properties; 2.3.2 Algorithms; Computational Results; 2.4 Multiple Resource Constraints: A Special Case 327 $a2.5 Concluding Remarks and LITERATURE REVIEW3: Equitable Resource Allocation: Lexicographic Minimax and Maximin Optimization; 3.1 Formulation and Optimality Properties; 3.2 Minimax Algorithms; 3.2.1 The Minimax Activity Deletion Algorithm; 3.2.2 The Minimax Activity Addition Algorithm; 3.2.3 The Minimax Constraints Evaluation Algorithm; 3.2.4 Lower and Upper Bounds; 3.3 The Lexicographic Minimax Algorithm; Computational Results; 3.4 Extension to Nonseparable Objective Function; 3.5 Concluding Remarks and LITERATURE REVIEW; 4: Equitable Resource Allocation with Substitutable Resources 327 $a4.1 Representations of Substitutable Resources4.1.1 Transitive Substitutable Resources Represented by Trees; 4.1.2 Transitive Substitutable Resources Represented by Acyclic Graphs; 4.1.3 Nontransitive Substitutable Resources Represented by Bipartite Graphs; 4.1.4 Activity-Dependent Substitutable Resources Represented by Bipartite Graphs; 4.1.5 Solution Approach; 4.2 Transitive Substitutable Resources Represented by Trees; 4.2.1 Formulation; 4.2.2 The Minimax Algorithm; 4.2.3 The Lexicographic Minimax Algorithm; Computational Results; 4.2.4 Lower and Upper Bounds 327 $a4.3 Transitive Substitutable Resources Represented by Acyclic Graphs 330 $a"This book focuses primarily on equitable resource allocation and is a valuable reference to those who work to solve diverse optimization problems"--$cProvided by publisher. 410 0$aInformation and Communication Technology Series, 606 $aOperations research 606 $aResource allocation 615 0$aOperations research. 615 0$aResource allocation. 676 $a620.0042 676 $a658.4/033 676 $a658.4033 686 $aTEC029000$2bisacsh 700 $aLuss$b Hanan$0521615 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910830225603321 996 $aEquitable resource allocation$9836987 997 $aUNINA