Opportunities for Combinatorial Optimization in Computational Biology
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
This is a survey designed for mathematical programming people who do not know molecular biology and want to learn the kinds of combinatorial optimization problems that arise. After a brief introduction to the biology, we present optimization models pertaining to sequencing, evolutionary explanations, structure prediction, and recognition. Additional biology is given in the context of the problems, including some motivation for disease diagnosis and drug discovery. Open problems are cited with an extensive bibliography, and we offer a guide to getting started in this exciting frontier.
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
A N EW A PPROACH TO D ECODING L IFE : Systems Biology
Ideker, T., Galitski, T., & Hood, L. (2001) · Annual Review of Genomics and Human Genetics · doi:10.1146/annurev.genom.2.1.343 · Cited by 1,664 · cited 2×
“One approach to this is systems biology (Ideker et al. 2001), taking into account some of the many biological complexities.”
BackgroundFast algorithms for large-scale genome alignment and comparison
Delcher, A. L. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.11.2478 · Cited by 1,036 · cited 1×
“(One exception is MUMmer Delcher et al. 1999, 2002; which is based on sequence alignment, using an advanced implementation of suffix trees Kurtz 1999.)”
MethodDelcher, 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 · cited 1×
“(One exception is MUMmer Delcher et al. 1999, 2002; which is based on sequence alignment, using an advanced implementation of suffix trees Kurtz 1999.)”
MethodInference of haplotypes from PCR-amplified samples of diploid populations.
(1990) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040591 · Cited by 765 · cited 3×
“This problem was studied by Gusfield (1999), who proved it is NP-hard and APXhard.”
BackgroundMethod
Cited by
W hats H ap : Weighted Haplotype Assembly for Future-Generation Sequencing Reads
Patterson, M., Marschall, T., Pisanti, N., van Iersel, L., Stougie, L., Klau, G. W., & Schönhuth, A. (2015) · Journal of Computational Biology · doi:10.1089/cmb.2014.0157 · Cited by 453
Optimization in computational systems biology
Banga, J. R. (2008) · BMC Systems Biology · doi:10.1186/1752-0509-2-47 · Cited by 278
Penas, D. R., Henriques, D., González, P., Doallo, R., Saez-Rodriguez, J., & Banga, J. R. (2017) · PLOS ONE · doi:10.1371/journal.pone.0182186 · Cited by 16
Metadata
- Authors
- Greenberg, H. J., Hart, W. E., & Lancia, G.
- Venue
- INFORMS Journal on Computing
- Published
- 2004-08
- Volume
- 16
- Issue
- 3
- Pages
- 211-231
- ISSN
- 0899-1499 (ISSN-L)
- 1091-9856
- 1526-5528
- OpenAlex
- W2033837064
- Cited by
- 120
- References
- 4
- FWCI
- 3.61
- 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: Opportunities for Combinatorial Optimization in Computational Biology. https://app.cochat.ai/papers/10.1287/ijoc.1040.0073
- The paper
- Greenberg, H. J., Hart, W. E., & Lancia, G. (2004). Opportunities for Combinatorial Optimization in Computational Biology. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.1040.0073
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.