Memory Efficient Minimum Substring Partitioning

Summary: Disk-based Minimum Substring Partitioning (MSP) enables memory-efficient de Bruijn graph construction for large genomes. Partitions reads into small in-memory chunks, processes them independently, and merges using k-mer overlaps to compress from Theta(kn) to Theta(n), enabling assembly on commodity hardware. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 10656
Venue: VLDB
Year: 2013
Pagerank: -
Overall Rank: 13,455 | 6.40%
DOI: -

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
6,319	ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings	2012	VLDB	5.1132714e-05
8,035	A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union	2011	SIGMOD	4.6009403e-05
2,583	Practical Suffix Tree Construction	2004	VLDB	8.497732e-05
12,365	Improving Suffix Array Locality for Fast Pattern Matching on Disk	2008	SIGMOD	4.1945683e-05
4,333	An Efficient Index Structure for String Databases	2001	VLDB	6.2805237e-05
4,378	Fast Processing and Querying of 170TB of Genomics Data via a Repeated And Merged BloOm Filter (RAMBO)	2021	SIGMOD	6.2404547e-05
13,272	On the String Matching with k Differences in DNA Databases	2021	VLDB	-
2,250	Genome-scale Disk-based Suffix Tree Indexing	2007	SIGMOD	9.2009942e-05
3,862	A Partition-Based Approach to Structure Similarity Search	2014	VLDB	6.687769e-05
4,550	Serial and Parallel Methods for I/O Efficient Suffix Tree Construction	2009	SIGMOD	6.0924864e-05