Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

Jeffrey Scott Vitter

Showing results (1-10 of 7) with videos related to

Pageof 1
Sort By:
IEEE/ACM Transactions on Computational Biology and Bioinformatics|October 5, 2011
Efficient maximal repeat finding using the burrows-wheeler transform and wavelet treeM Oğuzhan Külekci, Jeffrey Scott Vitter, Bojian Xu
IEEE/ACM Transactions on Computational Biology and Bioinformatics|January 28, 2020
Efficient Compression and Indexing for Highly Repetitive DNA Sequence CollectionsHongwei Huo, Xiaoyang Chen, Xu Guo, et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics|September 11, 2015
An Efficient Exact Algorithm for the Motif Stem Search Problem over Large AlphabetsQiang Yu, Hongwei Huo, Jeffrey Scott Vitter, et al.
Bioinformatics (Oxford, England)|September 15, 2021
CIndex: compressed indexes for fast retrieval of FASTQ filesHongwei Huo, Pengfei Liu, Chenhui Wang, et al.
IEEE Transactions on Nanobioscience|April 15, 2015
An Efficient Algorithm for Discovering Motifs in Large DNA Data SetsQiang Yu, Hongwei Huo, Xiaoyang Chen, et al.
BMC Bioinformatics|July 26, 2016
RefSelect: a reference sequence selection algorithm for planted (l, d) motif searchQiang Yu, Hongwei Huo, Ruixing Zhao, et al.
BMC Genomics|October 13, 2011
Ψ-RA: a parallel sparse index for genomic read alignmentM Oğuzhan Külekci, Wing-Kai Hon, Rahul Shah, et al.
Pageof 1

Showing results (1-10 of 7) with videos related to

Sort By:
Pageof 1
IEEE/ACM Transactions on Computational Biology and Bioinformatics|October 5, 2011
Efficient maximal repeat finding using the burrows-wheeler transform and wavelet treeM Oğuzhan Külekci, Jeffrey Scott Vitter, Bojian Xu
IEEE/ACM Transactions on Computational Biology and Bioinformatics|January 28, 2020
Efficient Compression and Indexing for Highly Repetitive DNA Sequence CollectionsHongwei Huo, Xiaoyang Chen, Xu Guo, et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics|September 11, 2015
An Efficient Exact Algorithm for the Motif Stem Search Problem over Large AlphabetsQiang Yu, Hongwei Huo, Jeffrey Scott Vitter, et al.
Bioinformatics (Oxford, England)|September 15, 2021
CIndex: compressed indexes for fast retrieval of FASTQ filesHongwei Huo, Pengfei Liu, Chenhui Wang, et al.
IEEE Transactions on Nanobioscience|April 15, 2015
An Efficient Algorithm for Discovering Motifs in Large DNA Data SetsQiang Yu, Hongwei Huo, Xiaoyang Chen, et al.
BMC Bioinformatics|July 26, 2016
RefSelect: a reference sequence selection algorithm for planted (l, d) motif searchQiang Yu, Hongwei Huo, Ruixing Zhao, et al.
BMC Genomics|October 13, 2011
Ψ-RA: a parallel sparse index for genomic read alignmentM Oğuzhan Külekci, Wing-Kai Hon, Rahul Shah, et al.
Pageof 1