Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 218

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Local graph alignment and motif search in biological networks

Open access
Berg, Johannes, Lässig, Michael·2004·Proceedings of the National Academy of Sciences

Abstract

Interaction networks are of central importance in postgenomic molecular biology, with increasing amounts of data becoming available by high-throughput methods. Examples are gene regulatory networks or protein interaction maps. The main challenge in the analysis of these data is to read off biological functions from the topology of the network. Topological motifs , i.e., patterns occurring repeatedly at different positions in the network, have recently been identified as basic modules of molecular information processing. In this article, we discuss motifs derived from families of mutually similar but not necessarily identical patterns. We establish a statistical model for the occurrence of such motifs, from which we derive a scoring function for their statistical significance. Based on this scoring function, we develop a search algorithm for topological motifs called graph alignment , a procedure with some analogies to sequence alignment. The algorithm is applied to the gene regulation network of Escherichia coli .

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1073/pnas.0305199101

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Cited by

See all 218

Metadata

Authors
Berg, J., & Lässig, M.
Venue
Proceedings of the National Academy of Sciences
Published
2004-09-24
Volume
101
Issue
41
Pages
14689-14694
ISSN
  • 0027-8424 (ISSN-L)
  • 1091-6490
OpenAlex
W1984220047
Cited by
218
References
3
FWCI
5.47
Type
journal article
Language
en
Open access
green

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: Local graph alignment and motif search in biological networks. https://app.cochat.ai/papers/10.1073/pnas.0305199101
The paper
Berg, J., & Lässig, M. (2004). Local graph alignment and motif search in biological networks. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.0305199101

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.