☰

Abdullah N. Arslan, Ph.D. - Publications

Affiliations: 
2002 University of California, Santa Barbara, Santa Barbara, CA, United States 
Tree Info Similar researchers PubMed Report error

32 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2018 Arslan AN. A fast algorithm for all-pairs Hamming distances Information Processing Letters. 139: 49-52. DOI: 10.1016/J.Ipl.2018.07.006  0.437
2017 Arslan AN, Anandan J, Fry E, Monschke K, Ganneboina N, Bowerman J. Efficient RNA structure comparison algorithms. Journal of Bioinformatics and Computational Biology. 1740009. PMID 29113560 DOI: 10.1142/S0219720017400091  0.407
2017 Hempelmann CF, Solomon D, Arslan AN, Attardo S, Blount GP, Adkins T, Sirakov NM. Detecting necessary and sufficient parts for assembling a functional weapon Proceedings of Spie. 10202. DOI: 10.1117/12.2268808  0.314
2016 Hempelmann CF, Arslan AN, Attardo S, Blount GP, Sirakov NM. Real life identification of partially occluded weapons in video frames Proceedings of Spie. 9844. DOI: 10.1117/12.2224344  0.367
2015 Arslan AN, George B, Stor K. New algorithms for pattern matching with wildcards and length constraints Discrete Mathematics, Algorithms and Applications. 7: 1550032. DOI: 10.1142/S1793830915500329  0.504
2015 Arslan AN. Fast Algorithms for Local Similarity Queries in Two Sequences International Journal of Foundations of Computer Science. 26: 625-642. DOI: 10.1142/S0129054115500355  0.536
2015 Arslan AN, Hempelmann CF, Attardo S, Blount GP, Sirakova NN, Sirakov NM. Identification of partially occluded firearms through partonomy Proceedings of Spie - the International Society For Optical Engineering. 9476. DOI: 10.1117/12.2184102  0.396
2015 Arslan AN, Hempelmann CF, Attardo S, Blount GP, Sirakov NM. Threat assessment using visual hierarchy and conceptual firearms ontology Optical Engineering. 54. DOI: 10.1117/1.Oe.54.5.053109  0.319
2015 Arslan AN, He D, He Y, Wu X. Pattern matching with wildcards and length constraints using maximum network flow Journal of Discrete Algorithms. 35: 9-16. DOI: 10.1016/J.Jda.2015.08.003  0.466
2014 Hempelmann CF, Arslan AN, Attardo S, Blount GP, Sirakov NM. Assessing the threat of firearms: New threat formula, resources, and ontological linking algorithms Proceedings of Spie - the International Society For Optical Engineering. 9091. DOI: 10.1117/12.2050814  0.343
2013 Wu X, Zhu X, He Y, Arslan AN. PMBC: pattern mining from biological sequences with wildcard constraints. Computers in Biology and Medicine. 43: 481-92. PMID 23566394 DOI: 10.1016/J.Compbiomed.2013.02.006  0.37
2013 Arslan AN, Hempelmann CF, Ferrante CD, Attardo S, Sirakov NM. From shape to threat: Exploiting the convergence between visual and conceptual organization for weapon identification and threat assessment Proceedings of Spie - the International Society For Optical Engineering. 8744. DOI: 10.1117/12.2015591  0.344
2010 Arslan AN. A fast longest common subsequence algorithm for similar strings Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6031: 82-93. DOI: 10.1007/978-3-642-13089-2_7  0.443
2008 Arslan AN. An algorithm with linear expected running time for string editing with substitutions and substring reversals Information Processing Letters. 106: 213-218. DOI: 10.1016/J.Ipl.2007.11.017  0.488
2007 Arslan AN. Regular expression constrained sequence alignment Journal of Discrete Algorithms. 5: 647-661. DOI: 10.1016/J.Jda.2007.01.003  0.475
2006 Arslan AN. An algorithm for string edit distance allowing substring reversals Proceedings - Sixth Ieee Symposium On Bioinformatics and Bioengineering, Bibe 2006. 220-226. DOI: 10.1109/BIBE.2006.253338  0.45
2006 Arslan AN, He D. An improved algorithm for the regular expression constrained multiple sequence alignment problem Proceedings - Sixth Ieee Symposium On Bioinformatics and Bioengineering, Bibe 2006. 121-126. DOI: 10.1109/BIBE.2006.253324  0.441
2006 Chen G, Wu X, Zhu X, Arslan AN, He Y. Efficient string matching with wildcards and length constraints Knowledge and Information Systems. 10: 399-419. DOI: 10.1007/S10115-006-0016-8  0.456
2006 Zheleva E, Arslan AN. Fast motif search in protein sequence databases Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3967: 670-681. DOI: 10.1007/11753728_67  0.354
2006 Arslan AN. Efficient approximate dictionary look-up for long words over small alphabets Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3887: 118-129. DOI: 10.1007/11682462_15  0.357
2006 He D, Arslan AN. A * algorithms for the constrained multiple sequence alignment problem Proceedings of the 2006 International Conference On Artificial Intelligence, Icai'06. 2: 479-485.  0.471
2006 He D, Arslan AN, Ling ACH. A fast algorithm for the constrained multiple sequence alignment problem Acta Cybernetica. 17: 701-717.  0.492
2005 He D, Arslan AN. A space-efficient algorithm for the constrained pairwise sequence alignment problem. Genome Informatics. International Conference On Genome Informatics. 16: 237-46. PMID 16901106 DOI: 10.11234/Gi1990.16.2_237  0.597
2005 Arslan AN, Eǧecioǧlu O. Algorithms for the constrained longest common subsequence problems International Journal of Foundations of Computer Science. 16: 1099-1109. DOI: 10.1142/S0129054105003674  0.454
2005 He D, Arslan AN. A parallel algorithm for the constrained multiple sequence alignment problem Proceedings - Bibe 2005: 5th Ieee Symposium On Bioinformatics and Bioengineering. 2005: 258-262. DOI: 10.1109/BIBE.2005.9  0.454
2005 Arslan AN. Multiple sequence alignment containing a sequence of regular expressions Proceedings of the 2005 Ieee Symposium On Computational Intelligence in Bioinformatics and Computational Biology, Cibcb '05. 2005.  0.446
2004 Arslan AN, Eǧecioǧlu O. Dynamic programming based approximation algorithms for sequence alignment with constraints Informs Journal On Computing. 16: 441-458. DOI: 10.1287/Ijoc.1040.0097  0.653
2004 Arslan AN, Eǧecioǧlu O. Dictionary look-up within small edit distance International Journal of Foundations of Computer Science. 15: 57-71. DOI: 10.1142/S0129054104002303  0.441
2002 Arslan AN, Eǧecioǧlu O. Approximation algorithms for local alignment with length constraints International Journal of Foundations of Computer Science. 13: 751-767. DOI: 10.1142/S0129054102001436  0.659
2002 Arslan AN, Eğecioğlu Ö. Efficient computation of long similar subsequences Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2476: 77-90. DOI: 10.1007/3-540-45735-6_8  0.657
2002 Arslan AN, Eğgecioğlu Ö. Algorithms for local alignment with length constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2286: 38-51.  0.575
2001 Arslan AN, EÄŸecioÄŸlu O, Pevzner PA. A new approach to sequence comparison: normalized sequence alignment. Bioinformatics (Oxford, England). 17: 327-37. PMID 11301301 DOI: 10.1093/Bioinformatics/17.4.327  0.547
Show low-probability matches.