155 citations · 158 across the 7 of their papers we have counts for
7 papers
Efficient Approximate Kernel Based Spike Sequence Classification
Sarwan Ali, Bikram Sahoo, Muhammad Asad Khan +3
Machine learning (ML) models, such as SVM, for tasks like classification and clustering of sequences, require a definition of distance/similarity between pairs of sequences. Severa…
Unlocking capacities of viral genomics for the COVID-19 pandemic response
Sergey Knyazev, Karishma Chhugani, Varuni Sarwal +19
More than any other infectious disease epidemic, the COVID-19 pandemic has been characterized by the generation of large volumes of viral genomic data at an incredible pace due to…
Technology dictates algorithms: Recent developments in read alignment
Mohammed Alser, Jeremy Rotman, Kodi Taraszka +13
Massively parallel sequencing techniques have revolutionized biological and medical sciences by providing unprecedented insight into the genomes of humans, animals, and microbes. M…
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two
Piotr Berman, Marek Karpinski, Alex Zelikovsky
We design a 3/2 approximation algorithm for the Generalized Steiner Tree problem (GST) in metrics with distances 1 and 2. This is the first polynomial time approximation algorithm…
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
Piotr Berman, Marek Karpinski, Alex Zelikovsky
We give a 1.25 approximation algorithm for the Steiner Tree Problem with distances one and two, improving on the best known bound for that problem.
Bright-Field AAPSM Conflict Detection and Correction
C. Chiang, A. Kahng, S. Sinha +2
As feature sizes shrink, it will be necessary to use AAPSM (Alternating-Aperture Phase Shift Masking) to image critical features, especially on the polysilicon layer. This imposes…