Nathaniel K. Brown

Orcid: 0000-0002-6201-2301

According to our database1, Nathaniel K. Brown authored at least 14 papers between 2022 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Optimal-Time Move Structure Balancing and LCP Array Computation from the RLBWT.
CoRR, March, 2026

Col-BWT: Pangenomic Seed Chaining with Maximal Matches Improves Read Classification.
J. Comput. Biol., 2026

Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations.
Proceedings of the 24th International Symposium on Experimental Algorithms, 2026

2025
KeBaB: <i>k</i>-mer based breaking for finding super-maximal exact matches.
CoRR, February, 2025

KeBaB: k-mer Based Breaking for Finding Long MEMs.
Proceedings of the String Processing and Information Retrieval, 2025

Improved Pangenomic Classification Accuracy with Chain Statistics.
Proceedings of the Research in Computational Molecular Biology, 2025

Faster Run-Length Compressed Suffix Arrays.
Proceedings of the From Strings to Graphs, 2025

2024


MIOV: Reordering MOVI for even better locality.
CoRR, 2024

MEM-Based Pangenome Indexing for k-mer Queries.
Proceedings of the 24th International Workshop on Algorithms in Bioinformatics, 2024

Faster Maximal Exact Matches with Lazy LCP Evaluation.
Proceedings of the Data Compression Conference, 2024

2023
Augmented Thresholds for MONI.
Proceedings of the Data Compression Conference, 2023

2022
RLBWT Tricks.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022


  Loading...