MARC

LEADER 00000cam a2200000 i 4500
001 EBOOKCENTRAL_on1162371958
003 OCoLC
005 20240329122006.0
006 m o d
007 cr |||||||||||
008 101117s2011 nyu ob 001 0 eng
010 |a  2020687515 
040 |a DLC  |b eng  |e rda  |c DLC  |d VLY  |d OCLCO  |d N$T  |d YDXCP  |d E7B  |d OCLCF  |d NLGGC  |d EBLCP  |d DEBSZ  |d AZK  |d MERUC  |d AGLDB  |d MOR  |d PIFAG  |d ZCU  |d U3W  |d STF  |d WRM  |d VTS  |d NRAMU  |d ICG  |d INT  |d VT2  |d AU@  |d WYU  |d DKC  |d UKCRE  |d AJS  |d OCLCO  |d OCLCQ  |d OCLCO  |d TMA  |d OCLCL  |d OCLCQ 
019 |a 744633858  |a 961610127  |a 962588429  |a 988410431  |a 991988113  |a 1037938329  |a 1038669462  |a 1045505245  |a 1055349791  |a 1058082439  |a 1065857818  |a 1081197469  |a 1153489249 
020 |a 9781612094755  |q (ebook) 
020 |a 1612094759 
020 |z 9781611227574  |q (hardcover) 
020 |z 1611227577 
029 1 |a AU@  |b 000051401050 
029 1 |a CHNEW  |b 000607804 
029 1 |a DEBBG  |b BV044087983 
029 1 |a DEBSZ  |b 45659972X 
029 1 |a DEBSZ  |b 472555278 
029 1 |a NZ1  |b 15346047 
035 |a (OCoLC)1162371958  |z (OCoLC)744633858  |z (OCoLC)961610127  |z (OCoLC)962588429  |z (OCoLC)988410431  |z (OCoLC)991988113  |z (OCoLC)1037938329  |z (OCoLC)1038669462  |z (OCoLC)1045505245  |z (OCoLC)1055349791  |z (OCoLC)1058082439  |z (OCoLC)1065857818  |z (OCoLC)1081197469  |z (OCoLC)1153489249 
042 |a pcc 
050 0 0 |a QA76.9.F38 
072 7 |a COM  |x 051390  |2 bisacsh 
072 7 |a COM  |x 051440  |2 bisacsh 
072 7 |a COM  |x 051230  |2 bisacsh 
082 0 0 |a 005.1  |2 22 
049 |a UAMI 
245 0 0 |a Pathway modeling and algorithm research /  |c Nikos E. Mastorakis, editor. 
264 1 |a New York :  |b Nova Science Publishers, Inc.,  |c [2011] 
300 |a 1 online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Computer science, technology and applications 
500 |a Includes bibliographical references and index. 
588 |a Description based on print version record. 
504 |a Includes bibliographical references and index. 
546 |a English. 
505 0 |a PATHWAY MODELING AND ALGORITHM RESEARCH; PATHWAY MODELING AND ALGORITHM RESEARCH; Contents; Preface; Biological Pathways and Their Modeling; Abstract; 1. Introduction; 2. Classification; 2.1. Gene Regulatory Networks (GRN); 2.2. Signaling Pathways (SP); 2.3. Metabolic Pathways (MP); 3. Modeling Biological Pathways; 4. Current Research; Conclusions; References; Supervised Learning Approaches in Pathway Modeling; Abstract; 1. Introduction; 2. Classification via Supervised Learning; 2.1. Various Approaches; 2.1.1. Artificial Neural Networks (ANN). 
505 8 |a 2.1.1.1. Application to Metabolic Pathway Modeling2.1.1.2. Application to Signal Transduction Modeling; 2.1.1.3. Application to Gene Regulatory Network Modeling; 2.1.2. Support Vector Machines (SVM); 2.1.2.1. Application to Metabolic Pathway Modeling; 2.1.2.2. Application to Gene Regulatory Network Modeling; 2.1.2.3. Application to Signal Transduction Modeling; 2.1.3. Nearest Neighbor Approach; 2.1.3.1. Application to Metabolic Pathway Modeling; 2.1.3.2. Application to Gene Regulatory Network Modeling; 2.1.3.3. Application to Signal Transduction Modeling; 2.1.4. Bayesian Classifier. 
505 8 |a 2.1.4.1. Application to Metabolic Pathway Modeling2.1.4.2. Application to Gene Regulatory Network Modeling; 2.1.4.3. Application to Signal Transduction Modeling; 2.1.5. Logistic Regression; 2.1.5.1. Application to Metabolic Pathway Modeling; 2.1.5.2. Application to Gene Regulatory Network Modeling; 2.1.5.3. Application to Signal Transduction Modeling; 2.1.6. Discriminant Analysis; 2.1.6.1. Application to Metabolic Pathway Modeling; 2.1.6.2. Application to Gene Regulatory Network Modeling; 2.1.6.3. Application to Signal Transduction Modeling; 2.1.7. Decision Trees. 
505 8 |a 2.1.7.1. Application to Metabolic Pathway Modeling2.1.7.2. Application to Gene Regulatory Network Modeling; 2.1.7.3. Application to Signal Transduction Modeling; 3. Current Research; Conclusions; References; Shortest Path Algorithms in Pathway Analysis; Abstract; 1. Introduction; 2. Shortest Path Algorithms; 3. Types of Shortest Path Algorithms; 3.1. Dijkstra's Algorithm; 3.1.1. Algorithm; 3.1.2. Pseudocode; 3.1.3. Time Complexity; 3.2. Bellman-Ford Algorithm; 3.2.1. Algorithm; 3.2.2. Pseudocode; 3.2.3. Time Complexity; 3.3. Floyd-Warshall algorithm; 3.3.1. Algorithm; 3.3.2. Pseudocode. 
505 8 |a 3.3.3. Time Complexity3.4. Johnson's Algorithm; 3.4.1. Algorithm; 3.4.2. Pseudocode; 3.4.3. Time Complexity; 3.5. Breadth First Search (BFS); 3.5.1. Algorithm; 3.5.2. Pseudocode; 3.5.3. Time Complexity; 3.6. k-Shortest Paths; 3.6.1. Algorithm; 3.6.2. Pseudo-Code; 3.6.2.1. Removing Path Algorithm; 3.6.2.2. Deviation Path Algorithm; 3.6.3. Time Complexity; 3.7. Linear Programming; 3.7.1. Algorithm; 3.7.2. Pseudo-Code; 3.7.3. Time Complexity; 4. Application of Shortest Path Algorithms in; Biological Pathways; 4.1. Application to Metabolic Pathway Modeling. 
590 |a eBooks on EBSCOhost  |b EBSCO eBook Subscription Academic Collection - Worldwide 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Fault-tolerant computing. 
650 0 |a Mobile computing. 
650 0 |a Algorithms. 
650 2 |a Algorithms 
650 6 |a Tolérance aux fautes (Informatique) 
650 6 |a Informatique mobile. 
650 6 |a Algorithmes. 
650 7 |a algorithms.  |2 aat 
650 7 |a COMPUTERS  |x Programming  |x Open Source.  |2 bisacsh 
650 7 |a COMPUTERS  |x Software Development & Engineering  |x Tools.  |2 bisacsh 
650 7 |a COMPUTERS  |x Software Development & Engineering  |x General.  |2 bisacsh 
650 7 |a Algorithms  |2 fast 
650 7 |a Fault-tolerant computing  |2 fast 
650 7 |a Mobile computing  |2 fast 
700 1 |a Mastorakis, Nikos E.,  |e editor. 
758 |i has work:  |a Pathway modeling and algorithm research (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCXpqgcJ4hY9qBp3H7KdJ6q  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Print version:  |t Pathway modeling and algorithm research  |d Hauppauge, N.Y. : Nova Science Publishers, c2011.  |z 9781611227574 (hardcover)  |w (DLC) 2010043927 
830 0 |a Computer science, technology and applications. 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3019069  |z Texto completo 
938 |a ProQuest Ebook Central  |b EBLB  |n EBL3019069 
938 |a ebrary  |b EBRY  |n ebr10662876 
938 |a EBSCOhost  |b EBSC  |n 376665 
938 |a YBP Library Services  |b YANK  |n 7082529 
994 |a 92  |b IZTAP