(1+epsilon)-Approximation of Sorting by Reversals and Transpositions (Englisch)
- Neue Suche nach: Eriksen, N.
- Neue Suche nach: European Association for Theoretical Computer Science
- Neue Suche nach: Danish Center for Basic Research in Computer Science
- Neue Suche nach: Eriksen, N.
- Neue Suche nach: Gascuel, O.
- Neue Suche nach: Moret, B. M. E.
- Neue Suche nach: European Association for Theoretical Computer Science
- Neue Suche nach: Danish Center for Basic Research in Computer Science
In:
Workshop on bioinformatics; Algorithms in bioinformatics
;
227-237
;
2001
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Print
-
Titel:(1+epsilon)-Approximation of Sorting by Reversals and Transpositions
-
Beteiligte:
-
Kongress:1st, Workshop on bioinformatics; Algorithms in bioinformatics ; 2001 ; Arhus, Denmark
-
Erschienen in:LECTURE NOTES IN COMPUTER SCIENCE ; 227-237
-
Verlag:
- Neue Suche nach: Springer
-
Erscheinungsort:Berlin , New York
-
Erscheinungsdatum:01.01.2001
-
Format / Umfang:11 pages
-
Anmerkungen:Includes bibliographical references and index
-
ISBN:
-
ISSN:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Print
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
An Improved Model for Statistical AlignmentMiklos, I. / Toroczkai, Z. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 11
-
Improving Profile-Profile Alignment via Log Average Scoringvon Ohsen, N. / Zimmer, R. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 27
-
False Positives in Genomic Map Assembly and Sequence ValidationAnantharaman, T. / Mishra, B. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 41
-
Boosting EM for Radiation Hybrid and Genetic MappingSchiex, T. / Chabrier, P. / Bouchez, M. / Milan, D. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 52
-
Placing Probes along the Genome Using Pairwise Distance DataCasey, W. / Mishra, B. / Wigler, M. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 69
-
Comparing a Hidden Markov Model and a Stochastic Context-Free GrammarJagota, A. / Lyngso, R. B. / Pedersen, C. N. S. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 85
-
Assessing the Statistical Significance of Overrepresented OligonucleotidesDenise, A. / Regnier, M. / Vandenbogaert, M. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 98
-
Pattern Matching and Pattern Discovery Algorithms for Protein TopologiesViksna, J. / Gilbert, D. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 112
-
Computing Linking Numbers of a FiltrationEdelsbrunner, H. / Zomorodian, A. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 128
-
Side Chain-Positioning as an Integer Programming ProblemEriksson, O. / Zhou, Y. / Elofsson, A. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 142
-
A Chemical-Distance-Based Test for Positive Darwinian SelectionPupko, T. / Sharan, R. / Hasegawa, M. / Shamir, R. / Graur, D. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 156
-
Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial TimeGanapathysaravanabavan, G. / Warnow, T. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 164
-
Experiments in Computing Sequences of ReversalsBergeron, A. / Strasbourg, F. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 175
-
Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole GenomesWang, L.-S. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 189
-
Finding an Optimal Inversion Median: Experimental ResultsSiepel, A. C. / Moret, B. M. E. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 204
-
Analytic Solutions for Three-Taxon ML~M~C Trees with Variable Rates Across SitesChor, B. / Hendy, M. / Penny, D. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 214
-
The Performance of Phylogenetic Methods on Trees of Bounded DiameterNakhleh, L. / Roshan, U. / StJohn, K. / Sun, J. / Warnow, T. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 227
-
(1+epsilon)-Approximation of Sorting by Reversals and TranspositionsEriksen, N. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 238
-
On the Practical Solution of the Reversal Median ProblemCaprara, A. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 252
-
Algorithms for Finding Gene ClustersHeber, S. / Stoye, J. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 264
-
Determination of Binding Amino Acids Based on Random Peptide Array Screening Datavan der Veen, P. J. / Wessels, L. F. A. / Slootstra, J. W. / Meloen, R. H. / Reinders, M. J. T. / Hellendoorn, J. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 278
-
A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding SitesBarash, Y. / Bejerano, G. / Friedman, N. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001
- 294
-
Comparing Assemblies Using Fragments and Mate-PairsHuson, D. H. / Halpern, A. L. / Lai, Z. / Myers, E. W. / Reinert, K. / Sutton, G. G. / European Association for Theoretical Computer Science / Danish Center for Basic Research in Computer Science et al. | 2001