The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Sequencing-by-hybridization revisited: the analog-spectrum proposal
Abstract
All published approaches to DNA sequencing by hybridization (SBH) consist of the biochemical acquisition of the spectrum of a target sequence (the set of its subsequences conforming to a given probing pattern) followed by the algorithmic reconstruction of the sequence from its spectrum. In the "standard" or "uniform" approach, the probing pattern is a string of length L and the length of reliably reconstructible sequences is known to be mlen = O(2(L)). For a fixed microarray area, higher sequencing performance can be achieved by inserting nonprobing gaps ("wild-cards") in the probing pattern. The reconstruction, however, must cope with the emergence of fooling probes due to the gaps and algorithmic failure occurs when the spectrum becomes too densely populated, although we can achieve mcomp = 0(4(L)). Despite the combinatorial success of gapped probing, all current approaches are based on a biochemically unrealistic spectrum-acquisition model (digital-spectrum). The reality of hybridization is much more complex. Departing from the conventional model, in this paper, we propose an alternative, called the analog-spectrum model, which more closely reflects the biochemical process. This novel modeling reestablishes probe length as the performance-governing factor, adopting "semidegenerate bases" as suitable emulators of currently inadequate universal bases. One important conclusion is that accurate biochemical measurements are pivotal to the success of SBH. The theoretical proposal presented in this paper should be a convincing stimulus for the needed biotechnological work.
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
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics
SantaLucia, J. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.4.1460 · Cited by 2,793
Introduction to Computational Biology
Waterman, M. S. (1995) · Springer eBooks · doi:10.1007/978-1-4899-6846-3 · Cited by 960
Thermodynamics and NMR of Internal G·T Mismatches in DNA
Allawi, H. T., & SantaLucia, J. (1997) · Biochemistry · doi:10.1021/bi962590c · Cited by 623 · cited 1×
“Energy parameters have also been determined for mismatches [1], [2], [3], [4].”
BackgroundComputational Molecular Biology: An Algorithmic Approach
Pevzner, P. A. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/2022.001.0001 · Cited by 605
Peyret, N., Seneviratne, P. A., Allawi, H. T., & SantaLucia, J. (1999) · Biochemistry · doi:10.1021/bi9825091 · Cited by 568
Sequencing of megabase plus DNA by hybridization: Theory of the method
Dramanac, R., Labat, I., Brukner, I., & Crkvenjakov, R. (1989) · Genomics · doi:10.1016/0888-7543(89)90290-5 · Cited by 354
A novel method for nucleic acid sequence determination
Bains, W., & Smith, G. C. (1988) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(88)80246-7 · Cited by 313
l-Tuple DNA Sequencing: Computer Analysis
Pevzner, P. A. (1989) · Journal of Biomolecular Structure and Dynamics · doi:10.1080/07391102.1989.10507752 · Cited by 286
Allawi, H. T., & SantaLucia, J. (1998) · Biochemistry · doi:10.1021/bi9803729 · Cited by 255
Cited by
Fischl, B., Liu, A., & Dale, A. M. (2001) · IEEE Transactions on Medical Imaging · doi:10.1109/42.906426 · Cited by 1,751
CLARANS: a method for clustering objects for spatial data mining
Ng, R. T., & Han, J. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2002.1033770 · Cited by 1,202
Some new indexes of cluster validity
Bezdek, J. C., & Pal, N. R. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.678624 · Cited by 1,132
Maurer, C. R., Qi, R., & Raghavan, V. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1177156 · Cited by 911
Efficient collision detection using bounding volume hierarchies of k-DOPs
Klosowski, J. T., Held, M., Mitchell, J. S. B., Sowizral, H., & Zikan, K. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.675649 · Cited by 873
The farthest point strategy for progressive image sampling
Eldar, Y., Lindenbaum, M., Porat, M., & Zeevi, Y. Y. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.623193 · Cited by 693
Algorithms for packet classification
Gupta, P., & McKeown, N. (2001) · IEEE Network · doi:10.1109/65.912717 · Cited by 655
Minutia Cylinder-Code: A New Representation and Matching Technique for Fingerprint Recognition
Cappelli, R., Ferrara, M., & Maltoni, D. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.52 · Cited by 637
ICP registration using invariant features
Sharp, G. C., Lee, S. W., & Wehe, D. K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.982886 · Cited by 614
Coverage in wireless ad hoc sensor networks
Li, X.-Y., Wan, P.-J., & Frieder, O. (2003) · IEEE Transactions on Computers · doi:10.1109/tc.2003.1204831 · Cited by 521
Linear time Euclidean distance transform algorithms
Breu, H., Gil, J., Kirkpatrick, D., & Werman, M. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.391389 · Cited by 454
Collision detection for interactive graphics applications
Hubbard, P. M. (1995) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.466717 · Cited by 414
Outlier mining in large high-dimensional data sets
Angiulli, F., & Pizzuti, C. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.31 · Cited by 365
A simple algorithm for nearest neighbor search in high dimensions
Nene, S. A., & Nayar, S. K. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.615448 · Cited by 311
WISE design of indoor wireless systems: practical computation and optimization
Fortune, S. J., Gay, D. M., Kernighan, B. W., Landron, O., Valenzuela, R. A., & Wright, M. H. (1995) · IEEE Computational Science and Engineering · doi:10.1109/99.372944 · Cited by 289
Computational Geometry—A Survey
Lee, & Preparata (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676388 · Cited by 283
Computational Capabilities of Graph Neural Networks
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005141 · Cited by 225
Metadata
- Authors
- Preparata, F. P.
- Venue
- IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Published
- 2004-01
- Volume
- 1
- Issue
- 1
- Pages
- 46-52
- ISSN
- 1545-5963 (ISSN-L)
- OpenAlex
- W2167862746
- Cited by
- 320
- References
- 15
- FWCI
- 23.38
- 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.