---
id: "claim:long-read-sequencing-transcriptome-quantification-with-lr-kallisto-2025-12-01-p-c105976de1:f250097a64e4edb9ff1d"
kind: "claim"
title: "Increasing T-DBG k-mer length from 31 to 63 reduced nodes from 3,698 to 2,708 in the first 1,000 LRGASP transcripts."
description: ""
url: "https://sina.bio/claim/increasing-t-dbg-k-mer-length-from-31-to-63-reduced-nodes-from-3-698-to-6cca417e"
---

# Increasing T-DBG k-mer length from 31 to 63 reduced nodes from 3,698 to 2,708 in the first 1,000 LRGASP transcripts.

## Content

Increasing T-DBG k-mer length from 31 to 63 reduced nodes from 3,698 to 2,708 in the first 1,000 LRGASP transcripts.

## Metadata

```json
{
  "claim_position": 138,
  "source_publication_id": "version:long-read-sequencing-transcriptome-quantification-with-lr-kallisto--2025-12-01-plos-computational-biology",
  "source_work_id": "work:long-read-sequencing-transcriptome-quantification-with-lr-kallisto"
}
```

## Connections (2)

### Long-read sequencing transcriptome quantification with lr-kallisto

- ID: `version:long-read-sequencing-transcriptome-quantification-with-lr-kallisto--2025-12-01-plos-computational-biology`
- Kind: `publication`
- Direction: `incoming`
- URL: <https://sina.bio/publication/long-read-sequencing-transcriptome-quantification-with-lr-kallisto-3ccc217c>

This publication contains this grounded claim.

> How- ever, when we scale this out to just the first 1000 transcripts listed in the LRGASP basic gencode human annotation, we found a reduction from 3,698 nodes using the 31 k-mer T-DBG to 2,708 nodes using the 63 k-mer T-DBG and 4,687 edges to 3,238 edges, respectively.

Source: 2025-12-01-plos-computational-biology.pdf — <https://sina.bio/source/2025-12-01-plos-computational-biology-pdf>

### Increasing T-DBG k-mer length from 31 to 63 reduces graph complexity and improves mapping quality and mapping rate for l

- ID: `result:long-read-sequencing-transcriptome-quantification-with-lr-kallisto-2025-12-01-p-c105976de1:9fa5376c3ea9c40e2d04`
- Kind: `result`
- Direction: `incoming`
- URL: <https://sina.bio/result/increasing-t-dbg-k-mer-length-from-31-to-63-reduces-graph-complexity-an-3b501b9b>

This claim supports this result.