default search action
Gary Benson
Person information
- affiliation: Boston University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c23]Joshua Loving, John P. Scaduto, Gary Benson:
An SIMD Algorithm for Wraparound Tandem Alignment. ISBRA 2017: 140-149 - 2016
- [j31]Gary Benson:
Editorial: Nucleic Acids Research annual Web Server Issue in 2016. Nucleic Acids Res. 44(Webserver-Issue): W1-W2 (2016) - [j30]Gary Benson, Martin Farach-Colton
, Moshe Lewenstein, Ely Porat:
Special issue in honor of the 60th birthday of Amihood Amir. Theor. Comput. Sci. 638: 1-2 (2016) - [j29]Gary Benson, Avivit Levy, S. Maimoni, D. Noifeld, B. Riva Shalom:
LCSk: A refined similarity measure. Theor. Comput. Sci. 638: 11-26 (2016) - 2015
- [j28]Gary Benson:
Editorial: Nucleic Acids Research annual Web Server Issue in 2015. Nucleic Acids Res. 43(Webserver-Issue): W1-W2 (2015) - 2014
- [j27]Joshua Loving, Yözen Hernández, Gary Benson:
BitPAl: a bit-parallel, general integer-scoring sequence alignment algorithm. Bioinform. 30(22): 3166-3173 (2014) - [j26]Allyson L. Byrd, Joseph F. Perez-Rogers, Solaiappan Manimaran, Eduardo Castro-Nallar
Clinical PathoScope: rapid alignment and filtration for accurate pathogen identification in clinical samples using unassembled sequencing data. BMC Bioinform. 15: 262 (2014) - [j25]Gary Benson:
Editorial: Nucleic Acids Research annual Web Server Issue in 2014. Nucleic Acids Res. 42(Webserver-Issue): 1-2 (2014) - [i1]Gary Benson, Avivit Levy, B. Riva Shalom:
Longest Common Subsequence in k-length substrings. CoRR abs/1402.2097 (2014) - 2013
- [j24]Gary Benson:
Editorial. Nucleic Acids Res. 41(Webserver-Issue): 1-2 (2013) - [c22]Gary Benson, Yözen Hernández
A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm. CPM 2013: 50-61 - [c21]Gary Benson, Avivit Levy, B. Riva Shalom:
Longest Common Subsequence in k Length Substrings. SISAP 2013: 257-265 - 2012
- [j23]Panagiotis Papapetrou
Mining poly-regions in DNA. Int. J. Data Min. Bioinform. 6(4): 406-428 (2012) - [j22]Gary Benson:
Editorial. Nucleic Acids Res. 40(Web-Server-Issue): 1-2 (2012) - 2010
- [j21]Gary Benson:
Editorial. Nucleic Acids Res. 38(Web-Server-Issue): 1-2 (2010)
2000 – 2009
- 2009
- [j20]Denise Y. F. Mak, Gary Benson:
All hits all the time: parameter-free calculation of spaced seed sensitivity. Bioinform. 25(3): 302-308 (2009) - [j19]Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena
Pattern matching with address errors: Rearrangement distances. J. Comput. Syst. Sci. 75(6): 359-370 (2009) - [j18]Gary Benson:
Nucleic Acids Research annual Web Server Issue in 2009. Nucleic Acids Res. 37(Web-Server-Issue): 1-2 (2009) - [c20]Denise Y. F. Mak, Gary Benson:
Consensus RNA Secondary Structure Prediction by Ranking k-Length Stems. BIOCOMP 2009: 521-527 - 2008
- [j17]Gary Benson:
Editorial. Nucleic Acids Res. 36(Web-Server-Issue): 1 (2008) - [c19]Gary Benson, Denise Y. F. Mak:
Exact Distribution of a Spaced Seed Statistic for DNA Homology Detection. SPIRE 2008: 282-293 - 2007
- [j16]Waibhav Tembe, Nela Zavaljevski, Elizabeth A. Bode, Catherine Chase, Jeanne Geyer, Leonard P. Wasieloski, Gary Benson, Jaques Reifman:
Oligonucleotide fingerprint identification for microarray-based pathogen diagnostic assays. Bioinform. 23(1): 5-13 (2007) - [j15]Dina Sokol, Gary Benson, Justin Tojeira:
Tandem repeats over the edit distance. Bioinform. 23(2): 30-35 (2007) - [j14]Benjamin B. Andken, In Lim, Gary Benson, John J. Vincent, Matthew T. Ferenc, Bianca Heinrich, Larissa A. Jarzylo, Heng-Ye Man, James O. Deshler:
3'-UTR SIRF: A database for identifying clusters of short interspersed repeats in 3' untranslated regions. BMC Bioinform. 8 (2007) - [j13]Yevgeniy Gelfand, Alfredo Rodriguez, Gary Benson:
TRDB - The Tandem Repeats Database. Nucleic Acids Res. 35(Database-Issue): 80-87 (2007) - [j12]Gary Benson:
Editorial. Nucleic Acids Res. 35(Web-Server-Issue): 1 (2007) - [j11]Joti Giordano, Yongchao Ge
Evolutionary History of Mammalian Transposons Determined by Genome-Wide Defragmentation. PLoS Comput. Biol. 3(7) (2007) - [c18]Denise Y. F. Mak, Gary Benson:
All Hits All The Time: Parameter Free Calculation of Seed Sensitivity. APBC 2007: 327-340 - 2006
- [c17]Panagiotis Papapetrou, Gary Benson, George Kollios
Discovering Frequent Poly-Regions in DNA Sequences. ICDM Workshops 2006: 94-98 - [c16]Denise Y. F. Mak, Yevgeniy Gelfand, Gary Benson:
Indel seeds for homology search. ISMB (Supplement of Bioinformatics) 2006: 341-349 - [c15]Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne:
Pattern matching with address errors: rearrangement distances. SODA 2006: 1221-1229 - 2005
- [j10]Gary Benson:
Tandem cyclic alignment. Discret. Appl. Math. 146(2): 124-133 (2005) - 2003
- [c14]Gary Benson:
Composition Alignment. WABI 2003: 447-461 - [e1]Gary Benson, Roderic D. M. Page
Algorithms in Bioinformatics, Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003, Proceedings. Lecture Notes in Computer Science 2812, Springer 2003, ISBN 3-540-20076-2 [contents] - 2002
- [c13]Gary Benson:
A new distance measure for comparing sequence profiles based on path lengths along an entropy surface. ECCB 2002: 44-53 - 2001
- [c12]Gary Benson:
Tandem Cyclic Alignment. CPM 2001: 118-130
1990 – 1999
- 1999
- [c11]Gary Benson, Lan Dong:
Reconstructing the Duplication History of a Tandem Repeat. ISMB 1999: 44-53 - 1998
- [j9]Amihood Amir, Gary Benson, Martin Farach
Optimal Parallel Two Dimensional Text Searching on a CREW PRAM. Inf. Comput. 144(1): 1-17 (1998) - [j8]Gary Benson, X. Su:
On the Distribution of K-tuple Matches for Sequence Homology: A Constant Time Exact Calculation of the Variance. J. Comput. Biol. 5(1): 87-100 (1998) - [j7]Amihood Amir, Gary Benson:
Two-Dimensional Periodicity in Rectangular Arrays. SIAM J. Comput. 27(1): 90-106 (1998) - [c10]Gary Benson:
An algorithm for finding tandem repeats of unspecified pattern size. RECOMB 1998: 20-29 - 1997
- [j6]Amihood Amir, Gary Benson, Martin Farach
Optimal Two-Dimensional Compressed Matching. J. Algorithms 24(2): 354-379 (1997) - [j5]Gary Benson:
Sequence Alignment with Tandem Duplication. J. Comput. Biol. 4(3): 351-367 (1997) - [j4]Fengzhu Sun, Gary Benson, Norman Arnheim
Pooling Strategies for Establishing Physical Genome Maps Using FISH. J. Comput. Biol. 4(4): 467-486 (1997) - [c9]Gary Benson:
Sequence alignment with tandem duplication. RECOMB 1997: 27-36 - [c8]Fengzhu Sun, Gary Benson, Norman Arnheim
Pooling strategies for establishing physical genome maps using FISH. RECOMB 1997: 294-299 - 1996
- [j3]Amihood Amir, Gary Benson, Martin Farach
Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files. J. Comput. Syst. Sci. 52(2): 299-307 (1996) - 1995
- [j2]Gary Benson:
A Space Efficient Algorithm for Finding the Best Nonoverlapping Alignment Score. Theor. Comput. Sci. 145(1&2): 357-369 (1995) - 1994
- [j1]Amihood Amir, Gary Benson, Martin Farach
An Alphabet Independent Approach to Two-Dimensional Pattern Matching. SIAM J. Comput. 23(2): 313-323 (1994) - [c7]Gary Benson:
A Space Efficient Algorithm for Finding the Best Non-Overlapping Alignment Score. CPM 1994: 1-14 - [c6]Amihood Amir, Gary Benson, Martin Farach
Optimal Two-Dimensional Compressed Matching. ICALP 1994: 215-226 - [c5]Amihood Amir, Gary Benson, Martin Farach:
Let Sleeping Files Lie: Pattern Matching in Z-compressed Files. SODA 1994: 705-714 - 1993
- [c4]Amihood Amir, Gary Benson, Martin Farach
Optimal Parallel Two Dimensional Pattern Matching. SPAA 1993: 79-85 - 1992
- [c3]Amihood Amir, Gary Benson:
Efficient Two-Dimensional Compressed Matching. Data Compression Conference 1992: 279-288 - [c2]Amihood Amir, Gary Benson:
Two-Dimensional Periodicity and Its Applications. SODA 1992: 440-452 - [c1]Amihood Amir, Gary Benson, Martin Farach
Alphabet Independent Two Dimensional Matching. STOC 1992: 59-68
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: