| 2008 |
|---|
| 28 | EE | 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 |
|---|
| 27 | EE | Dan He,
Abdullah N. Arslan,
Yu He,
Xindong Wu:
Iterative Refinement of Repeat Sequence Specification Using Constrained Pattern Matching.
BIBE 2007: 1199-1203 |
| 26 | EE | Abdullah N. Arslan,
Peyman Bizargity:
Phylogeny By Top Down Clustering Using a Given Multiple Alignment.
BIBE 2007: 809-814 |
| 25 | EE | Abdullah N. Arslan:
A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings.
FCT 2007: 40-51 |
| 24 | EE | Yu He,
Xindong Wu,
Xingquan Zhu,
Abdullah N. Arslan:
Mining Frequent Patterns with Wildcards from Biological Sequences.
IRI 2007: 329-334 |
| 23 | EE | Abdullah N. Arslan:
Regular expression constrained sequence alignment.
J. Discrete Algorithms 5(4): 647-661 (2007) |
| 2006 |
|---|
| 22 | | Abdullah N. Arslan,
Dan He:
An improved algorithm for the regular expression constrained multiple sequence alignment problem.
BIBE 2006: 121-126 |
| 21 | | Abdullah N. Arslan:
An algorithm for string edit distance allowing substring reversals.
BIBE 2006: 220-226 |
| 20 | | Dan He,
Abdullah N. Arslan:
Space-Efficient Parallel Algorithms for the Constrained Multiple Sequence Alignment Problem.
BIOCOMP 2006: 10-16 |
| 19 | EE | Elena Zheleva,
Abdullah N. Arslan:
Fast Motif Search in Protein Sequence Databases.
CSR 2006: 670-681 |
| 18 | | Dan He,
Abdullah N. Arslan:
FastPCMSA: An Improved Parallel Algorithm for the Constrained Multiple Sequence Alignment Problem.
FCS 2006: 88-94 |
| 17 | | Dan He,
Abdullah N. Arslan:
A* Algorithms for the Constrained Multiple Sequence Alignment Problem.
IC-AI 2006: 479-485 |
| 16 | EE | Abdullah N. Arslan:
Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets.
LATIN 2006: 118-129 |
| 15 | EE | 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) |
| 2005 |
|---|
| 14 | EE | Dan He,
Abdullah N. Arslan:
A Parallel Algorithm for the Constrained Multiple Sequence Alignment Problem.
BIBE 2005: 258-262 |
| 13 | EE | Abdullah N. Arslan:
Regular Expression Constrained Sequence Alignment.
CPM 2005: 322-333 |
| 12 | EE | Abdullah N. Arslan,
Ömer Egecioglu:
Algorithms For The Constrained Longest Common Subsequence Problems.
Int. J. Found. Comput. Sci. 16(6): 1099-1109 (2005) |
| 2004 |
|---|
| 11 | EE | Abdullah N. Arslan,
Ömer Egecioglu:
Algorithms for the Constrained Longest Common Subsequence Problems.
Stringology 2004: 24-32 |
| 10 | EE | Abdullah N. Arslan,
Ömer Egecioglu:
Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints.
INFORMS Journal on Computing 16(4): 441-458 (2004) |
| 9 | EE | Abdullah N. Arslan,
Ömer Egecioglu:
Dictionary Look-Up Within Small Edit Distance.
Int. J. Found. Comput. Sci. 15(1): 57-71 (2004) |
| 2002 |
|---|
| 8 | EE | Abdullah N. Arslan,
Ömer Egecioglu:
Dictionary Look-Up within Small Edit Distance.
COCOON 2002: 127-136 |
| 7 | EE | Abdullah N. Arslan,
Ömer Egecioglu:
Algorithms for Local Alignment with Length Constraints.
LATIN 2002: 38-51 |
| 6 | EE | Abdullah N. Arslan,
Ömer Egecioglu:
Efficient Computation of Long Similar Subsequences.
SPIRE 2002: 77-90 |
| 5 | EE | Abdullah N. Arslan,
Ömer Egecioglu:
Approximation Algorithms for Local Alignment with Length Constraints.
Int. J. Found. Comput. Sci. 13(5): 751-767 (2002) |
| 2001 |
|---|
| 4 | EE | Abdullah N. Arslan,
Ömer Egecioglu:
An Improved Upper Bound on the Size of Planar Convex-Hulls.
COCOON 2001: 111-120 |
| 3 | EE | Abdullah N. Arslan,
Ömer Egecioglu,
Pavel A. Pevzner:
A new approach to sequence comparison: normalized sequence alignment.
RECOMB 2001: 2-11 |
| 2 | | Abdullah N. Arslan,
Ömer Egecioglu,
Pavel A. Pevzner:
A new approach to sequence comparison: normalized sequence alignment.
Bioinformatics 17(4): 327-337 (2001) |
| 1999 |
|---|
| 1 | EE | Abdullah N. Arslan,
Ömer Egecioglu:
An Efficient Uniform-Cost Normalized Edit Distance Algorithm.
SPIRE/CRIWG 1999: 8-15 |
