The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Spectral Algorithm for Seriation and the Consecutive Ones Problem
Abstract
In applications ranging from DNA sequencing through archeological dating to sparse matrix reordering, a recurrent problem is the sequencing of elements in such a way that highly correlated pairs of elements are near each other. That is, given a correlation function f reflecting the desire for each pair of elements to be near each other, find all permutations $\pi$ with the property that if $\pi(i) < \pi(j) < \pi(k)$ then $f(i,j) \ge f(i,k)$ and $f(j,k) \ge f(i,k)$. This seriationproblem is a generalization of the well-studied consecutive ones problem. We present a spectral algorithm for this problem that has a number of interesting features. Whereas most previous applications of spectral techniques provide only bounds or heuristics, our result is an algorithm that correctly solves a nontrivial combinatorial problem. In addition, spectral methods are being successfully applied as heuristics to a variety of sequencing problems, and our result helps explain and justify these applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Booth, K. S., & Lueker, G. S. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80045-1 · Cited by 1,488
Cited by
Tensor product methods and entanglement optimization for ab initio quantum chemistry
Szalay, S., Pfeffer, M., Murg, V., Barcza, G., Verstraete, F., Schneider, R., & Legeza, Ö. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24898 · Cited by 314
MatrixExplorer: a Dual-Representation System to Explore Social Networks
Henry, N., & Fekete, J.-D. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.160 · Cited by 266
Postmitotic nuclear pore assembly proceeds by radial dilation of small membrane openings
Otsuka, S., Steyer, A. M., Schorb, M., Hériché, J.-K., Hossain, M. J., Sethi, S., Kueblbeck, M., Schwab, Y., Beck, M., & Ellenberg, J. (2018) · Nature Structural & Molecular Biology · doi:10.1038/s41594-017-0001-9 · Cited by 90
Beckwith, K. S., Ødegård-Fougner, Ø., Morero, N. R., Barton, C., Schueder, F., Tang, W., Alexander, S., Peters, J. M., Jungmann, R., Birney, E., et al. (2025) · Nature Communications · doi:10.1038/s41467-025-61689-y · Cited by 13
Metadata
- Authors
- Atkins, J. E., Boman, E. G., & Hendrickson, B.
- Venue
- SIAM Journal on Computing
- Published
- 1998-01
- Volume
- 28
- Issue
- 1
- Pages
- 297-310
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2006935644
- Cited by
- 220
- References
- 1
- FWCI
- 2.01
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Spectral Algorithm for Seriation and the Consecutive Ones Problem. https://app.cochat.ai/papers/10.1137/s0097539795285771
- The paper
- Atkins, J. E., Boman, E. G., & Hendrickson, B. (1998). A Spectral Algorithm for Seriation and the Consecutive Ones Problem. SIAM Journal on Computing. https://doi.org/10.1137/s0097539795285771
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.