{
  "annotation_id": "715244bf-dd29-48e9-9038-6f0cd0b45825",
  "date_created": "2026-03-02T18:01:34.996000Z",
  "date_modified": "2026-03-02T18:01:34.996000Z",
  "file_hash": "0016bb53d89271fec1cdc0607541bb75f74215b341c4794104ac033e37aae5f9",
  "private": false,
  "record": {
    "abstract": "Among the distance based algorithms in phylogenetic tree reconstruction, the\nneighbor-joining algorithm has been a widely used and effective method. We\npropose a new algorithm which counts the number of consistent quartets for\ncherry picking with tie breaking. We show that the success rate of the new\nalgorithm is almost equal to that of neighbor-joining. This gives an\nexplanation of the qualitative nature of neighbor-joining and that of\ndissimilarity maps from DNA sequence data. Moreover, the new algorithm always\nreconstructs correct trees from quartet consistent dissimilarity maps.",
    "arxiv_id": "q-bio/0610020",
    "authors": [
      "Jin-Hwan Cho",
      "Dosang Joe",
      "Young Rock Kim"
    ],
    "categories": [
      "q-bio.PE"
    ],
    "doi": "10.4134/CKMS.2010.25.1.149",
    "journal_ref": "Commun. Korean Math. Soc. 25 (2010), no. 1, 149-160",
    "title": "Quartet consistency count method for reconstructing phylogenetic trees",
    "url": "https://arxiv.org/abs/q-bio/0610020"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "34b8347a-1db9-4c89-aa64-cadbb9e3bf78",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}