反馈文件质量
lgli/D:\HDD4\!genesis\SPR_NEW_2013-12\bok%3A978-3-540-44696-5.pdf
Algorithms in Bioinformatics: First International Workshop, WABI 2001 Århus Denmark, August 28–31, 2001 Proceedings 🔍
István Miklós, Zoltán Toroczkai (auth.), Olivier Gascuel, Bernard M. E. Moret (eds.) Springer-Verlag Berlin Heidelberg, Lecture Notes in Computer Science, Lecture Notes in Computer Science 2149, 1, 2001
英语 [en] · PDF · 7.3MB · 2001 · 📘 非小说类图书 · 🚀/lgli/lgrs/nexusstc/zlib · Save
描述
This book constitutes the refereed proceedings of the First International Workshop on Algorithms in Bioinformatics, WABI 2001, held in Aarhus, Denmark, in August 2001.
The 23 revised full papers presented were carefully reviewed and selected from more than 50 submissions. Among the issues addressed are exact and approximate algorithms for genomics, sequence analysis, gene and signal recognition, alignment, molecular evolution, structure determination or prediction, gene expression and gene networks, proteomics, functional genomics, and drug design; methodological topics from algorithmics; high-performance approaches to hard computational problems in bioinformatics.
备用文件名
lgrsnf/D:\HDD4\!genesis\SPR_NEW_2013-12\bok%3A978-3-540-44696-5.pdf
备用文件名
nexusstc/Algorithms in Bioinformatics: First International Workshop, WABI 2001 Århus Denmark, August 28–31, 2001 Proceedings/82936143df1e16e06bd27bff536237f0.pdf
备用文件名
zlib/Computers/Computer Science/István Miklós, Zoltán Toroczkai (auth.), Olivier Gascuel, Bernard M. E. Moret (eds.)/Algorithms in Bioinformatics: First International Workshop, WABI 2001 Århus Denmark, August 28–31, 2001 Proceedings_2302478.pdf
备选标题
Algorithms in Bioinformatics: First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings (Lecture Notes in Computer Science, 2149)
备选作者
First Intern. workshop, WABI 2001, Århus Denmark, Aug. 28-31, 2001; Olivier Gascuel Bernard M. E. Moret (eds.)
备选作者
International Workshop on Algorithms in Bioinformatics
备选作者
Olivier Gascuel; Bernard M. E Moret; WABI (Workshop)
备选作者
INTERNATIONAL WORKSHOP, 1., 2001, Arhus Denmark
备选作者
Gascuel, Olivier
备用出版商
Springer Berlin Heidelberg : Imprint : Springer
备用出版商
Springer Spektrum. in Springer-Verlag GmbH
备用出版商
Steinkopff. in Springer-Verlag GmbH
备用出版商
Springer London, Limited
备用出版商
Springer Nature
备用版本
Lecture notes in computer science : LNCS -- 2149, Berlin [etc.], Germany, 2001
备用版本
Lecture notes in computer science -- 2149., Berlin, New York, Aug 15, 2001
备用版本
Lecture notes in computer science, 1st ed. 2001, Berlin, Heidelberg, 2001
备用版本
1 edition, September 21, 2001
备用版本
Germany, Germany
备用版本
1, 2001 aug 17
备用版本
2003
备用版本
2013
元数据中的注释
lg1249719
元数据中的注释
{"container_title":"Lecture Notes in Computer Science","edition":"1","isbns":["3540425160","3540446966","9783540425168","9783540446965"],"issns":["0302-9743"],"last_page":314,"publisher":"Springer","series":"Lecture Notes in Computer Science 2149"}
元数据中的注释
Includes bibliographical references and index.
Also available via the World Wide Web.
元数据中的注释
Указ.
Библиогр. в конце докл.
元数据中的注释
РГБ
元数据中的注释
Russian State Library [rgb] MARC:
=001 002416578
=005 20040730115656.0
=008 040407s2001\\\\gw\||||\r\\\\\0||\u\eng|d
=017 \\ $a И4607-04 $b РГБ
=020 \\ $a 3-540-42516-0 (Berlin etc.)
=040 \\ $a RuMoRGB $b rus $e rcr
=041 0\ $a eng
=044 \\ $a gw
=084 \\ $a Е.с21я431(0) $2 rubbk
=245 00 $a Algorithms in bioinformatics $b Proceedings $c First Intern. workshop, WABI 2001, Århus Denmark, Aug. 28-31, 2001 ; Olivier Gascuel Bernard M. E. Moret (eds.)
=260 \\ $a Berlin [etc.] $b Springer $c Cop. 2001
=300 \\ $a X, 306, [1] с. $b ил., табл. $c 24 см.
=490 0\ $a Lecture notes in computer science : LNCS $v 2149 $x 0302-9743
=500 \\ $a Указ.
=504 \\ $a Библиогр. в конце докл.
=650 \7 $a Биологические науки -- Методика и техника научно-исследовательской работы -- Математические методы -- Материалы конференции $2 rubbk
=700 1\ $a Gascuel, Olivier $e ред.
=711 2\ $a Workshop on algorithms in bioinformatics $n 1 $c Årchus $d 2001
=773 18 $7 nnas $g 2149 $t Lecture notes in computer science : LNCS $d Berlin [etc.] : Springer, 1973- $h 24 см $x 0302-9743 $w 000854364
=852 4\ $a РГБ $b FB $j 15 85-3/123-1 $x 90
备用描述
An improved model for statistical alignment (I. Miklós, Z. Toroczkai). Improving profile-profile alignments via log average scoring (N. von ohsen, R. Zimmer). False positive s in genomic map assembly and sequence validation (T. Anantharaman, B. Mishra). Boosting EM for radiation hybrid and genetic mapping (T. Schiex, P. Chabrier, M. Bouchez, D. Milan). Placing probes along the genome using pairwise distance data (W. Casey, B. Mishra, M. Wigler). Comparing a Hidden Markov model and a stochastic context-free grammar (A. Jagota, R. B. Lyngso, C. N. S. Pedersen). Assessing the statistical significance of overrepresented oligonucleotides (A. Denise, M. Régnier, M. vandenbogaert). Pattern matching and pattern discovery algorithms for protein topologies (J. Viksna, D. Gilbert). Computing linking numbers of a filtration (H. Edelsbrusnner, A. Zomorodian). Side chain-positioning as an integer programming problem (O. Eriksson, Y. Zhou, A. Elofsson). A chemical-distance-based test for positive darwinian selection (T. Pupko, R. Sharan, M. Hasegawa, R. Shamir, D. Graur). Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynominal time (G. Ganapathysaravanabavan, T. Warnow). Experiments in computing sequences of reversals (A. Bergeron, François Strasbourg). Exact-IEBP: a new technique for estimating evolutionary distances between whole genomes (Li-San Wang). Finding an optimal inversion median: experimental results (A. C. Siepel, B. M. E. Moret). Analytic solutions for three-taxon MLMC trees with variable rates across sites (B. Chor, M. Hendy, D. Penny). The performance of phylogenetic methods on trees of bounded diameter (L. nakhleh, U. Roshan, K. St. John, J. Sun, T. Warnow). (1+E)- approximation of sorting by reversals and transpositions (N. Eriksen). On the practical solution of the reversal median problem (A. Caprara). Algorithms for finding gene clusters (S. Heber, J. Stoye). Determination of binding amino acids based on random peptide array screening data (P. J. van der Veen, L. F. A. Wessels, J. W. Sloostra, R. H. Meloen, M. J. T. Reinders, J. Hellendoorn). A simple hyper-geometric approach for discovering putative transcription factor binding sites (Y. Barash, G. Bejerano, N. Friedman). Comparing assemblies using fragments and mate-pairs (D. H. Huson, A. L. Halpern, Z. Lai, E. W. myers, K. Reinert, G. G. Sutton). Author index
备用描述
An Improved Model for Statistical Alignment....Pages 1-10
Improving Profile-Profile Alignments via Log Average Scoring....Pages 11-26
False Positives in Genomic Map Assembly and Sequence Validation....Pages 27-40
Boosting EM for Radiation Hybrid and Genetic Mapping....Pages 41-51
Placing Probes along the Genome Using Pairwise Distance Data....Pages 52-68
Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar....Pages 69-84
Assessing the Statistical Significance of Overrepresented Oligonucleotides....Pages 85-97
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies....Pages 98-111
Computing Linking Numbers of a Filtration....Pages 112-127
Side Chain-Positioning as an Integer Programming Problem....Pages 128-141
A Chemical-Distance-Based Test for Positive Darwinian Selection....Pages 142-155
Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time....Pages 156-163
Experiments in Computing Sequences of Reversals....Pages 164-174
Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes....Pages 175-188
Finding an Optimal Inversion Median: Experimental Results....Pages 189-203
Analytic Solutions for Three-Taxon ML MC Trees with Variable Rates Across Sites....Pages 204-213
The Performance of Phylogenetic Methods on Trees of Bounded Diameter....Pages 214-226
(1+ε)-Approximation of Sorting by Reversals and Transpositions....Pages 227-237
On the Practical Solution of the Reversal Median Problem....Pages 238-251
Algorithms for Finding Gene Clusters....Pages 252-263
Determination of Binding Amino Acids Based on Random Peptide Array Screening Data....Pages 264-277
A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites....Pages 278-293
Comparing Assemblies Using Fragments and Mate-Pairs....Pages 294-306
备用描述
Algorithms in Bioinformatics: First International Workshop, WABI 2001 Århus Denmark, August 28–31, 2001 Proceedings
Author: Olivier Gascuel, Bernard M. E. Moret
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42516-8
DOI: 10.1007/3-540-44696-6
Table of Contents:
An Improved Model for Statistical Alignment
Improving Profile-Profile Alignments via Log Average Scoring
False Positives in Genomic Map Assembly and Sequence Validation
Boosting EM for Radiation Hybrid and Genetic Mapping
Placing Probes along the Genome Using Pairwise Distance Data
Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar
Assessing the Statistical Significance of Overrepresented Oligonucleotides
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
Computing Linking Numbers of a Filtration
Side Chain-Positioning as an Integer Programming Problem
A Chemical-Distance-Based Test for Positive Darwinian Selection
Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time
Experiments in Computing Sequences of Reversals
Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes
Finding an Optimal Inversion Median: Experimental Results
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites
The Performance of Phylogenetic Methods on Trees of Bounded Diameter
(1+ε)-Approximation of Sorting by Reversals and Transpositions
On the Practical Solution of the Reversal Median Problem
Algorithms for Finding Gene Clusters
备用描述
We are very pleased to present the proceedings of the First Workshop on Bio- formatics (WABI 2001), which took place in Aarhus on August 28{31, 2001, under the auspices of the European Association for Theoretical Computer S- ence (EATCS) and the Danish Center for Basic Research in Computer Science (BRICS). TheWorkshop onAlgorithmsinBioinformatics coversresearch onallaspects of algorithmic work in bioinformatics. The emphasis is on discrete algorithms that address important problems in molecular biology. These are founded on sound models, are computationally e cient, and have been implemented and tested in simulationsand on real datasets. The goal is to present recent research results, including signi cant work-in-progress, and to identify and explore dir- tions of future research. Speci c topics of interest include, but are not limited to: { Exactandapproximatealgorithmsforgenomics,sequence analysis,gene and signal recognition, alignment, molecular evolution, structure determination or prediction, gene expression and gene networks, proteomics, functional genomics, and drug design. { Methods, software and dataset repositories for development and testing of such algorithms and their underlying models. { High-performance approaches to computationallyhardproblems inbioinf- matics, particularly optimization problems.
备用描述
<p><P>This book constitutes the refereed proceedings of the First International Workshop on Algorithms in Bioinformatics, WABI 2001, held in Aarhus, Denmark, in August 2001.<br>The 23 revised full papers presented were carefully reviewed and selected from more than 50 submissions. Among the issues addressed are exact and approximate algorithms for genomics, sequence analysis, gene and signal recognition, alignment, molecular evolution, structure determination or prediction, gene expression and gene networks, proteomics, functional genomics, and drug design; methodological topics from algorithmics; high-performance approaches to hard computational problems in bioinformatics.</p>
备用描述
The papers presented cover topics such as: exact and approximate algorithms for genomics; sequence analysis; gene and signal recognition; alignment; molecular evolution; structure determination or prediction; gene expression and gene networks; proteomics; and functional genomics.
备用描述
This book constitutes the refereed proceedings of the 12th International Workshop on Algorithms in Bioinformatics, WABI 2012, held in Ljubljana, Slovenia, in September 2012.
备用描述
Lecture Notes in Computer Science
Erscheinungsdatum: 15.08.2001
开源日期
2014-01-18
更多信息……

🚀 快速下载

成为会员以支持书籍、论文等的长期保存。为了感谢您对我们的支持，您将获得高速下载权益。❤️
如果您在本月捐款，您将获得双倍的快速下载次数。

🐢 低速下载

由可信的合作方提供。 更多信息请参见常见问题解答。 （可能需要验证浏览器——无限次下载！）

所有选项下载的文件都相同，应该可以安全使用。即使这样，从互联网下载文件时始终要小心。例如，确保您的设备更新及时。
显示外部下载
  • 对于大文件，我们建议使用下载管理器以防止中断。
    推荐的下载管理器：JDownloader
  • 您将需要一个电子书或 PDF 阅读器来打开文件，具体取决于文件格式。
    推荐的电子书阅读器：Anna的档案在线查看器、ReadEra和Calibre
  • 使用在线工具进行格式转换。
    推荐的转换工具：CloudConvert和PrintFriendly
  • 您可以将 PDF 和 EPUB 文件发送到您的 Kindle 或 Kobo 电子阅读器。
    推荐的工具：亚马逊的“发送到 Kindle”和djazz 的“发送到 Kobo/Kindle”
  • 支持作者和图书馆
    ✍️ 如果您喜欢这个并且能够负担得起，请考虑购买原版，或直接支持作者。
    📚 如果您当地的图书馆有这本书，请考虑在那里免费借阅。