0 EA
no
show
1   
장바구니 주문배송조회
   현재위치 : HOME >
Protein Bioinformatics
판매가격  : 50,000원
적립금  : 1,500점
출판사  : Wiley
저자  : Eidhammer
발행일  : 2004년
페이지 수  : 376면
ISBN  : 0470848391
소개하기  :
주문수량  :

Preface.

Acknowledgements.

Part I: SEQUENCE ANALYSIS.

1. Pairwise Global Alignment of Sequences.

1.1 Alignment and Evolution.

1.2 What is an Alignment?

1.3 A Scoring Scheme for the Model.

1.4 Finding Highest-Scoring Alignments with Dynamic Programming.

1.4.1 Determine Hi,j.

1.4.2 Use of matrices.

1.4.3 Finding the alignments that give the highest score.

1.4.4 Gaps.

1.5 Scoring Matrices.

1.6 Scoring Gaps: Gap Penalties.

1.7 Dynamic Programming for General Gap Penalty.

1.8 Dynamic Programming for Affine Gap Penalty.

1.9 Alignment Score and Sequence Distance.

1.10 Exercises.

1.11 Bibliographic notes.

2 Pairwise Local Alignment and Database Search.

2.1 The Basic Operation: Comparing Two Sequences.

2.2 Dot Matrices.

2.2.1 Filtering.

2.2.2 Repeating segments.

2.3 Dynamic Programming.

2.3.1 Initialization.

2.3.2 Finding the best local alignments.

2.3.3 Algorithms.

2.3.4 Scoring matrices and gap penalties.

2.4 Database Search: BLAST.

2.4.1 The procedure.

2.4.2 Preprocess the query: make the word list.

2.4.3 Scanning the database sequences.

2.4.4 Extending to HSP.

2.4.5 Introducing gaps.

2.4.6 Algorithm.

2.5 Exercises.

2.6 Bibliographic notes.

3. Statistical Analysis.

3.1 Hypothesis Testing for Sequence Homology.

3.1.1 Random generation of sequences.

3.1.2 Use of Z values for estimating the statistical significance.

3.2 Statistical Distributions.

3.2.1 Poisson probability distribution.

3.2.2 Extreme value distributions.

3.3 Theoretical Analysis of Statistical Significance.

3.3.1 The P value has an extreme value distribution.

3.3.2 Theoretical analysis for database search.

3.4 Probability Distributions for Gapped Alignments.

3.5 Assessing and Comparing Programs for Database Search.

3.5.1 Sensitivity and specificity.

3.5.2 Discrimination power.

3.5.3 Using more sequences as queries.

3.6 Exercises.

3.7 Bibliographic notes.

4 .Multiple Global Alignment and Phylogenetic Trees.

4.1 Dynamic Programming.

4.1.1 SP score of multiple alignments.

4.1.2 A pruning algorithm for the DP solution.

4.2 Multiple Alignments and Phylogenetic Trees.

4.3 Phylogeny.

4.3.1 The number of different tree topologies.

4.3.2 Molecular clock theory.

4.3.3 Additive and ultrametric trees.

4.3.4 Different approaches for reconstructing phylogenetic trees.

4.3.5 Distance-based construction.

4.3.6 Rooting of trees.

4.3.7 Statistical test: bootstrapping.

4.4 Progressive Alignment.

4.4.1 Aligning two subset alignments.

4.4.2 Clustering.

4.4.3 Sequence weights.

4.4.4 CLUSTAL.

4.5 Other Approaches.

4.6 Exercises.

4.7 Bibliographic notes.

5. Scoring Matrices.

5.1 Scoring Matrices Based on Physio-Chemical Properties.

5.2 PAM Scoring Matrices.

5.2.1 The evolutionary model.

5.2.2 Calculate substitution matrix.

5.2.3 Matrices for general evolutionary time.

5.2.4 Measuring sequence similarity by use of Mτ.

5.2.5 Odds matrices.

5.2.6 Scoring matrices (log-odds matrices).

5.2.7 Estimating the evolutionary distance.

5.3 BLOSUM Scoring Matrices.

5.3.1 Log-odds matrix.

5.3.2 Developing scoring matrices for different evolutionary distances.

5.4 Comparing BLOSUM and PAM Matrices.

5.5 Optimal Scoring Matrices.

5.5.1 Analysis for one sequence.

5.6 Exercises.

5.7 Bibliographic notes.

6. Profiles.

6.1 Constructing a Profile.

6.1.1 Notation.

6.1.2 Removing rows and columns.

6.1.3 Position weights.

6.1.4 Sequence weights.

6.1.5 Treating gaps.

6.2 Searching Databases with Profiles.

6.3 Iterated BLAST: PSI-BLAST.

6.3.1 Making the multiple alignment.

6.3.2 Constructing the profile.

6.4 HMM Profile.

6.4.1 Definitions for an HMM.

6.4.2 Constructing a profile HMM for a protein family.

6.4.3 Comparing a sequence with an HMM.

6.4.4 Protein family databases.

6.5 Exercises.

6.6 Bibliographic notes.

7. Sequence Patterns.

7.1 The PROSITE Language.

7.2 Exact/Approximate Matching.

7.3 Defining Pattern Classes by Imposing Constraints.

7.4 Pattern Scoring: Information Theory.

7.4.1 Information theory.

7.4.2 Scoring patterns.

7.5 Generalization and Specialization.

7.6 Pattern Discovery: Introduction.

7.7 Comparison-Based Methods.

7.7.1 Pivot-based methods.

7.7.2 Tree progressive methods.

7.8 Pattern-Driven Methods: Pratt.

7.8.1 The main procedure.

7.8.2 Preprocessing.

7.8.3 The pattern space.

7.8.4 Searching.

7.8.5 Ambiguous components.

7.8.6 Specialization.

7.8.7 Pattern scoring.

7.9 Exercises.

7.10 Bibliographic notes.

Part II: STRUCTURE ANALYSIS

8. Structures and Structure Descriptions.

8.1 Units of Structure Descriptions.

8.2 Coordinates.

8.3 Distance Matrices.

8.4 Torsion Angles.

8.5 Coarse Level Description.

8.5.1 Line segments (sticks).

8.5.2 Ellipsoid.

8.5.3 Helices.

8.5.4 Strands and sheets.

8.5.5 Topology of Protein Structure (TOPS).

8.6 Identifying the SSEs.

8.6.1 Use of distance matrices.

8.6.2 Define Secondary Structure of Proteins (DSSP).

8.7 Structure Comparison.

8.7.1 Structure descriptions for comparison.

8.7.2 Structure representation.

8.8 Framework for Pairwise Structure Comparison.

8.9 Exercises.

8.10 Bibliographic notes.

9. Superposition and Dynamic Programming.

9.1 Superposition.

9.1.1 Coordinate RMSD.

9.1.2 Distance RMSD.

9.1.3 Using RMSD as scoring of structure similarities.

9.2 Alternating Superposition and Alignment.

9.3 Double Dynamic Programming.

9.3.1 Low-level scoring matrices.

9.3.2 High-level scoring matrix.

9.3.3 Iterated double dynamic programming.

9.4 Similarity of the Methods.

9.5 Exercises.

9.6 Bibliographic notes.

10. Geometric Techniques.

10.1 Geometric Hashing.

10.1.1 Two-dimensional geometric hashing.

10.1.2 Geometric hashing for structure comparison.

10.1.3 Geometric hashing for SSE representation.

10.1.4 Clustering.

10.2 Distance Matrices.

10.2.1 Measuring the similarity of distance (sub)matrices.

10.3 Exercises.

10.4 Bibliographic notes.

11. Clustering: Combining Local Similarities.

11.1 Compatibility and Consistency.

11.2 Searching for Seed Matches.

11.3 Consistency.

11.3.1 Test for consistency.

11.3.2 Overlapping clusters.

11.4 Clustering Algorithms.

11.4.1 Linear clustering.

11.4.2 Hierarchical clustering.

11.5 Clustering by Use of Transformations.

11.5.1 Comparing transformations.

11.5.2 Calculating the new transformation.

11.5.3 Algorithm.

11.6 Clustering by Use of Relations.

11.6.1 How many relations to compare?

11.6.2 Geometric relation.

11.6.3 Distance relation.

11.6.4 Use of graph theory.

11.7 Refinement.

11.8 Exercises.

11.9 Bibliographic notes.

12. Significance and Assessment of Structure Comparisons.

12.1 Constructing Random Structure Models.

12.1.1 Use of distance geometry.

12.2 Use of Structure Databases.

12.2.1 Constructing nonredundant subsets.

12.2.2 Demarcation line for similarity.

12.3 Reversing the Protein Chain.

12.4 Randomized Alignment Models.

12.5 Assessing Comparison and Scoring Methods.

12.6 Is RMSD Suitable for Scoring?

12.7 Scoring and Biological Significance.

12.8 Exercises.

12.9 Bibliographic notes.

13. Multiple Structure Comparison.

13.1 Multiple Superposition.

13.2 Progressive Structure Alignment.

13.2.1 Scoring.

13.2.2 Construction of consensus.

13.3 Finding a Common Core from a Multiple Alignment.

13.4 Discovering Common Cores.

13.4.1 Finding the multiple seed matches.

13.4.2 Pairwise clustering.

13.4.3 Determining common cores.

13.4.4 Scoring clusters.

13.5 Local Structure Patterns.

13.5.1 Local packing patter


{교재 사용시 강의 자료 문의 바랍니다.}
상품정보고시
제품명 Protein Bioinformatics
판매가격 50,000원
제조사 Wiley
위 상품과 관련된 상품이 없습니다.
번호 제목 이름 별점 날짜
아직 작성된 상품평이 없습니다.
 
번호 제목 이름 날짜 비고
작성된 상품문의가 없습니다.
  상품문의하기
구입제품의 이상이 있을 경우
- 구입후 7일 이내에 동일제품으로 교환 가능하며 운송비는 판매자 부담입니다.
- 다른 제품으로 교환, 또는 이상이 없는 제품과 함께 교환을 원하실 경우 구매자께서 운송비를 부담합니다.

구입제품의 이상이 있을 경우 (색상,사이즈,다른상품교환)
- 구입후 7일이내 교환 가능하며 구매자께서 운송비를 부담합니다.
(30000원 이상 구매하셔서 택배비를 무상으로 받으셨을 경우, 취소하시게 되면 왕복 운송비를 구매자께서 부담합니다.)

!! 주의사항
비닐포장 및 Tag의 폐기 또는 훼손 등으로 상품 가치가 멸실된 경우에는 제한.
반품시에 해당 사은품이 있을 경우 같이 보내주셔야 합니다.
결제후 2~5일 이내에 상품을 받아 보실 수 있습니다.
국내 최대의 물류사 CJ택배를 통하여 신속하고 안전하게 배송됩니다.
3만원 이상 구입시 무료배송입니다.
(제주도를 포함한 도서,산간지역은 항공료 또는 도선료가 추가됩니다.)
결제방법은 신용카드, 국민/BC(ISP), 무통장입금, 적립금이 있습니다.
정상적이지 못한 결제로 인한 주문으로 판단될 때는 임의로 배송이 보류되거나,주문이 취소될 수 있습니다.
혜민스님의 따듯한 응 2018/07/28
생물정보학 번역본 더이상.. 2018/07/26
[답변] 생물정보학 번역본.. 2018/08/14
책이 불량입니다. 2018/06/22
정오표 없나요? 2018/06/03
Genomics, Proteomics and.. 60,000원
Functional Metabolism : .. 50,000원
상담시간    평일 09:30 ~ 18:00 토,일,공휴일 휴무
상담 및 문의전화    02-581-5811~3 |  팩스:02-521-6418 (worldscience5811@naver.com)
상호 : (주)월드사이언스|서울특별시 서초구 도구로 115, 1층(방배동, 월드빌딩)
사업자등록번호 : 120-81-64063 (정보확인)| 통신판매업신고 : 서울 서초 제1520호
대표이사 : 박선진| 개인정보 관리책임자 : 박선진| 개인정보 보호기간 : 회원탈퇴시
Copyrightⓒ (주)월드사이언스 All rights reserved. Designed by wepas.com