default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbdullah N. Arslan
Person information
- affiliation: Texas A&M University Commerce, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c27]Abdullah N. Arslan, Mutlu Mete, Anjali Kumari:
RNA Secondary Structure Database, Analysis Tool-Set, and Case-Study Results on SARS-CoV-2. BIBM 2021: 2471-2478
2010 – 2019
- 2018
- [j15]Abdullah N. Arslan:
A fast algorithm for all-pairs Hamming distances. Inf. Process. Lett. 139: 49-52 (2018) - [c26]Keith A. Monschke, Abdullah N. Arslan:
RNA secondary structure graphical rendering library. CIBCB 2018: 1-6 - [p1]Abdullah N. Arslan, Ömer Egecioglu:
Dynamic and Fractional Programming Based Approximation Algorithms for Sequence Alignment with Constraints. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2017
- [j14]Abdullah N. Arslan, Jithendar Anandan, Eric Fry, Keith Monschke, Nitin Ganneboina, Jason Bowerman:
Efficient RNA structure comparison algorithms. J. Bioinform. Comput. Biol. 15(6): 1740009:1-1740009:27 (2017) - [c25]Abdullah N. Arslan, Nikolay Metodiev Sirakov
:
Shape Matching for Rigid Objects by Aligning Sequences Based on Boundary Change Points. IWCIA 2017: 308-321 - 2015
- [j13]Abdullah N. Arslan, Betsy George, Kirsten Stor:
New algorithms for pattern matching with wildcards and length constraints. Discret. Math. Algorithms Appl. 7(3): 1550032:1-1550032:13 (2015) - [j12]Abdullah N. Arslan:
Fast Algorithms for Local Similarity Queries in Two Sequences. Int. J. Found. Comput. Sci. 26(5): 625-642 (2015) - [j11]Abdullah N. Arslan, Dan He, Yu He, Xindong Wu:
Pattern matching with wildcards and length constraints using maximum network flow. J. Discrete Algorithms 35: 9-16 (2015) - 2013
- [j10]Xindong Wu, Xingquan Zhu, Yu He, Abdullah N. Arslan:
PMBC: Pattern mining from biological sequences with wildcard constraints. Comput. Biol. Medicine 43(5): 481-492 (2013) - 2012
- [c24]Abdullah N. Arslan, Nikolay Metodiev Sirakov, Salvatore Attardo:
Weapon ontology annotation using boundary describing sequences. SSIAI 2012: 101-104 - 2010
- [c23]Abdullah N. Arslan, Arvind Chidri:
An Efficient Multiplication Algorithm for Thin Matrices and for Matrices with Similar Rows and Columns. CSC 2010: 147-152 - [c22]Abdullah N. Arslan:
A Fast Longest Common Subsequence Algorithm for Similar Strings. LATA 2010: 82-93
2000 – 2009
- 2009
- [r2]Abdullah N. Arslan:
Guided Sequence Alignment. Encyclopedia of Data Warehousing and Mining 2009: 964-969 - 2008
- [j9]Abdullah N. Arslan:
An algorithm with linear expected running time for string editing with substitutions and substring reversals. Inf. Process. Lett. 106(5): 213-218 (2008) - 2007
- [j8]Abdullah N. Arslan:
Regular expression constrained sequence alignment. J. Discrete Algorithms 5(4): 647-661 (2007) - [c21]Abdullah N. Arslan, Peyman Bizargity:
Phylogeny By Top Down Clustering Using a Given Multiple Alignment. BIBE 2007: 809-814 - [c20]Dan He, Abdullah N. Arslan, Yu He, Xindong Wu:
Iterative Refinement of Repeat Sequence Specification Using Constrained Pattern Matching. BIBE 2007: 1199-1203 - [c19]Abdullah N. Arslan:
A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings. FCT 2007: 40-51 - [c18]Yu He, Xindong Wu, Xingquan Zhu, Abdullah N. Arslan:
Mining Frequent Patterns with Wildcards from Biological Sequences. IRI 2007: 329-334 - [r1]Ömer Egecioglu, Abdullah N. Arslan:
Dynamic and Fractional Programming-Based Approximation Algorithms for Sequence Alignment with Constraints. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j7]Dan He, Abdullah N. Arslan, Alan C. H. Ling:
A Fast Algorithm for the Constrained Multiple Sequence Alignment Problem. Acta Cybern. 17(4): 701-717 (2006) - [j6]Gong Chen, Xindong Wu, Xingquan Zhu, Abdullah N. Arslan, Yu He:
Efficient string matching with wildcards and length constraints. Knowl. Inf. Syst. 10(4): 399-419 (2006) - [c17]Abdullah N. Arslan, Dan He:
An improved algorithm for the regular expression constrained multiple sequence alignment problem. BIBE 2006: 121-126 - [c16]Abdullah N. Arslan:
An algorithm for string edit distance allowing substring reversals. BIBE 2006: 220-226 - [c15]Dan He, Abdullah N. Arslan:
Space-Efficient Parallel Algorithms for the Constrained Multiple Sequence Alignment Problem. BIOCOMP 2006: 10-16 - [c14]Elena Zheleva, Abdullah N. Arslan:
Fast Motif Search in Protein Sequence Databases. CSR 2006: 670-681 - [c13]Dan He, Abdullah N. Arslan:
FastPCMSA: An Improved Parallel Algorithm for the Constrained Multiple Sequence Alignment Problem. FCS 2006: 88-94 - [c12]Dan He, Abdullah N. Arslan:
A* Algorithms for the Constrained Multiple Sequence Alignment Problem. IC-AI 2006: 479-485 - [c11]Abdullah N. Arslan:
Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets. LATIN 2006: 118-129 - 2005
- [j5]Abdullah N. Arslan, Ömer Egecioglu:
Algorithms For The Constrained Longest Common Subsequence Problems. Int. J. Found. Comput. Sci. 16(6): 1099-1109 (2005) - [c10]Dan He, Abdullah N. Arslan:
A Parallel Algorithm for the Constrained Multiple Sequence Alignment Problem. BIBE 2005: 258-262 - [c9]Abdullah N. Arslan:
Multiple Sequence Alignment Containing a Sequence of Regular Expressions. CIBCB 2005: 230-236 - [c8]Abdullah N. Arslan:
Regular Expression Constrained Sequence Alignment. CPM 2005: 322-333 - 2004
- [j4]Abdullah N. Arslan, Ömer Egecioglu:
Dictionary Look-Up Within Small Edit Distance. Int. J. Found. Comput. Sci. 15(1): 57-71 (2004) - [j3]Abdullah N. Arslan, Ömer Egecioglu:
Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints. INFORMS J. Comput. 16(4): 441-458 (2004) - [c7]Abdullah N. Arslan, Ömer Egecioglu:
Algorithms for the Constrained Longest Common Subsequence Problems. Stringology 2004: 24-32 - 2002
- [j2]Abdullah N. Arslan, Ömer Egecioglu:
Approximation Algorithms for Local Alignment with Length Constraints. Int. J. Found. Comput. Sci. 13(5): 751-767 (2002) - [c6]Abdullah N. Arslan, Ömer Egecioglu:
Dictionary Look-Up within Small Edit Distance. COCOON 2002: 127-136 - [c5]Abdullah N. Arslan, Ömer Egecioglu:
Algorithms for Local Alignment with Length Constraints. LATIN 2002: 38-51 - [c4]Abdullah N. Arslan, Ömer Egecioglu:
Efficient Computation of Long Similar Subsequences. SPIRE 2002: 77-90 - 2001
- [j1]Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner:
A new approach to sequence comparison: normalized sequence alignment. Bioinform. 17(4): 327-337 (2001) - [c3]Abdullah N. Arslan, Ömer Egecioglu:
An Improved Upper Bound on the Size of Planar Convex-Hulls. COCOON 2001: 111-120 - [c2]Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner:
A new approach to sequence comparison: normalized sequence alignment. RECOMB 2001: 2-11
1990 – 1999
- 1999
- [c1]Abdullah N. Arslan, Ömer Egecioglu:
An Efficient Uniform-Cost Normalized Edit Distance Algorithm. SPIRE/CRIWG 1999: 8-15
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-04-25 05:42 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:
