The DOI matches its Crossref record.
Introduction to Computational Biology: Maps, Sequences and Genomes.
Abstract
Preface Introduction Molecular Biology Mathematics, Statistics, and Computer Science Some Molecular Biology DNA and Proteins The Central Dogma The Genetic Code Transfer RNA and Protein Sequences Genes Are Not Simple Biological Chemistry Restriction Maps Introduction Graphs Interval Graphs Measuring Fragment Sizes Multiple Maps Double Digest Problem Classifying Multiple Solutions Algorithms for DDP Algorithms and Complexity DDP is N P-Complete Approaches to DDP Simulated Annealing: TSP and DDP Mapping with Real Data Cloning and Clone Libraries A Finite Number of Random Clones Libraries by Complete Digestion Libraries by Partial Digestion Genomes per Microgram Physical Genome Maps: Oceans, Islands, and Anchors Mapping by Fingerprinting Mapping by Anchoring An Overview of Clone Overlap Putting It Together Sequence Assembly Shotgun Sequencing Sequencing by Hybridization Shotgun Sequencing Revisited Databases and Rapid Sequence Analysis DNA and Protein Sequence Databases A Tree Representation of a Sequence Hashing a Sequence Repeats in a Sequence Sequence Comparison by Hashing Sequence Comparison with at most l Mismatches Sequence Comparison by Statistical Content Dynamic Programming Alignment of Two Sequences The Number of Alignments Shortest and Longest Paths in a Network Global Distance Alignment Global Similarity Alignment Fitting One Sequence into Another Local Alignment and Clumps Linear Space Algorithms Tracebacks Inversions Map Alignment Parametric Sequence Comparisons Multiple Sequence Alignment The Cystic Fibrosis Gene Dynamic Programming in r-Dimensions Weighted-Average Sequences Profile Analysis Alignment by Hidden Markov Models Consensus Word Analysis Probability and Statistics for Sequence Alignment Global Alignment Local Alignment Extreme Value Distributions The Chein-Stein Method Poisson Approximation and Long Matches Sequence Alignment with Scores Probability and Statistics for Sequence Patterns A Central Limit Theorem Nonoverlapping Pattern Counts Poisson Approximation Site Distributions RNA Secondary Structure Combinatorics Minimum Free-energy Structures Consensus folding Trees and Sequences Trees Distance Parsimony Maximum Likelihood Trees Sources and Perspectives Molecular Biology Physical Maps and Clone Libraries Sequence Assembly Sequence Comparisons Probability and Statistics RNA Secondary Structure Trees and Sequences References Problem Solutions and Hints Mathematical Notation Algorithm Index Author Index Subject Index
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Invitation to Fixed-Parameter Algorithms
Niedermeier, R. (2006) · doi:10.1093/acprof:oso/9780198566076.001.0001 · Cited by 1,668
SSAHA: A Fast Search Method for Large DNA Databases
Ning, Z., Cox, A. J., & Mullikin, J. C. (2001) · Genome Research · doi:10.1101/gr.194201 · Cited by 965
Delcher, A. L., Kasif, S., Fleischmann, R. D., Peterson, J., White, O., & Salzberg, S. L. (1999) · Nucleic Acids Research · doi:10.1093/nar/27.11.2369 · Cited by 893
“The standard algorithms for sequence alignment rely on either dynamic programming (7, 10 ) or hashing techniques ( 8,11).”
Alignment-free sequence comparison—a review
Vinga, S., & Almeida, J. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg005 · Cited by 804
MILITELLO, L. G., & HUTTON, R. J. B. (1998) · Ergonomics · doi:10.1080/001401398186108 · Cited by 581
Tracing information flow on a global scale using Internet chain-letter data
Liben-Nowell, D., & Kleinberg, J. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0708471105 · Cited by 422
Ancestral Inference in Population Genetics
Griffiths, R. C., & Tavare, S. (1994) · Statistical Science · doi:10.1214/ss/1177010378 · Cited by 388
Costanzo, M. C. (2001) · Nucleic Acids Research · doi:10.1093/nar/29.1.75 · Cited by 329
Joint Bayesian Estimation of Alignment and Phylogeny
Redelings, B. D., & Suchard, M. A. (2005) · Systematic Biology · doi:10.1080/10635150590947041 · Cited by 313
Ruan, Q., Dutta, D., Schwalbach, M. S., Steele, J. A., Fuhrman, J. A., & Sun, F. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl417 · Cited by 294
Costanzo, M. C. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.73 · Cited by 284
Sato, K., & Kaneko, K. (2007) · Physical Review E · doi:10.1103/physreve.75.061909 · Cited by 45
On the dispersion index of a Markovian molecular clock
Zheng, Q. (2001) · Mathematical Biosciences · doi:10.1016/s0025-5564(01)00067-0 · Cited by 17
Metadata
- Authors
- Waterman, M. S.
- Venue
- Biometrics
- Publisher
- JSTOR
- Published
- 1998-03
- Volume
- 54
- Issue
- 1
- Pages
- 398
- ISSN
- 0006-341X (ISSN-L)
- OpenAlex
- W2041397659
- Cited by
- 457
- References
- 0
- FWCI
- 9.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.