The most recent list can be found on on google scholar.
Lederman, Roy R
A random-permutations-based approach to fast read alignment Journal Article
In: BMC Bioinformatics, vol. 14, no. 5, pp. S8, 2013, ISSN: 1471-2105.
Abstract | Links | BibTeX | Tags: Algorithm, DNA sequencing, Fast algorithms, Neighbor Search, Random Permutation, Reference Genome, Reference Library, Search Problem
@article{lederman_random-permutations-based_2013,
title = {A random-permutations-based approach to fast read alignment},
author = {Roy R Lederman},
url = {https://doi.org/10.1186/1471-2105-14-S5-S8},
doi = {10.1186/1471-2105-14-S5-S8},
issn = {1471-2105},
year = {2013},
date = {2013-04-01},
urldate = {2021-10-26},
journal = {BMC Bioinformatics},
volume = {14},
number = {5},
pages = {S8},
abstract = {Read alignment is a computational bottleneck in some sequencing projects. Most of the existing software packages for read alignment are based on two algorithmic approaches: prefix-trees and hash-tables. We propose a new approach to read alignment using random permutations of strings.},
keywords = {Algorithm, DNA sequencing, Fast algorithms, Neighbor Search, Random Permutation, Reference Genome, Reference Library, Search Problem},
pubstate = {published},
tppubtype = {article}
}
Read alignment is a computational bottleneck in some sequencing projects. Most of the existing software packages for read alignment are based on two algorithmic approaches: prefix-trees and hash-tables. We propose a new approach to read alignment using random permutations of strings.