Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

2008 | ||
---|---|---|

29 | 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 | ||

28 | Dan He, Abdullah N. Arslan, Yu He, Xindong Wu: Iterative Refinement of Repeat Sequence Specification Using Constrained Pattern Matching. BIBE 2007: 1199-1203 | |

27 | Abdullah N. Arslan, Peyman Bizargity: Phylogeny By Top Down Clustering Using a Given Multiple Alignment. BIBE 2007: 809-814 | |

26 | Abdullah N. Arslan: A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings. FCT 2007: 40-51 | |

25 | Yu He, Xindong Wu, Xingquan Zhu, Abdullah N. Arslan: Mining Frequent Patterns with Wildcards from Biological Sequences. IRI 2007: 329-334 | |

24 | Abdullah N. Arslan: Regular expression constrained sequence alignment. J. Discrete Algorithms 5(4): 647-661 (2007) | |

2006 | ||

23 | Abdullah N. Arslan, Dan He: An improved algorithm for the regular expression constrained multiple sequence alignment problem. BIBE 2006: 121-126 | |

22 | Abdullah N. Arslan: An algorithm for string edit distance allowing substring reversals. BIBE 2006: 220-226 | |

21 | Dan He, Abdullah N. Arslan: Space-Efficient Parallel Algorithms for the Constrained Multiple Sequence Alignment Problem. BIOCOMP 2006: 10-16 | |

20 | Elena Zheleva, Abdullah N. Arslan: Fast Motif Search in Protein Sequence Databases. CSR 2006: 670-681 | |

19 | Dan He, Abdullah N. Arslan: FastPCMSA: An Improved Parallel Algorithm for the Constrained Multiple Sequence Alignment Problem. FCS 2006: 88-94 | |

18 | Dan He, Abdullah N. Arslan: A* Algorithms for the Constrained Multiple Sequence Alignment Problem. IC-AI 2006: 479-485 | |

17 | Abdullah N. Arslan: Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets. LATIN 2006: 118-129 | |

16 | 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) | |

15 | 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 | Dan He, Abdullah N. Arslan: A Parallel Algorithm for the Constrained Multiple Sequence Alignment Problem. BIBE 2005: 258-262 | |

13 | Abdullah N. Arslan: Regular Expression Constrained Sequence Alignment. CPM 2005: 322-333 | |

12 | 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 | Abdullah N. Arslan, Ömer Egecioglu: Algorithms for the Constrained Longest Common Subsequence Problems. Stringology 2004: 24-32 | |

10 | 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 | Abdullah N. Arslan, Ömer Egecioglu: Dictionary Look-Up Within Small Edit Distance. Int. J. Found. Comput. Sci. 15(1): 57-71 (2004) | |

2002 | ||

8 | Abdullah N. Arslan, Ömer Egecioglu: Dictionary Look-Up within Small Edit Distance. COCOON 2002: 127-136 | |

7 | Abdullah N. Arslan, Ömer Egecioglu: Algorithms for Local Alignment with Length Constraints. LATIN 2002: 38-51 | |

6 | Abdullah N. Arslan, Ömer Egecioglu: Efficient Computation of Long Similar Subsequences. SPIRE 2002: 77-90 | |

5 | 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 | Abdullah N. Arslan, Ömer Egecioglu: An Improved Upper Bound on the Size of Planar Convex-Hulls. COCOON 2001: 111-120 | |

3 | 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 | Abdullah N. Arslan, Ömer Egecioglu: An Efficient Uniform-Cost Normalized Edit Distance Algorithm. SPIRE/CRIWG 1999: 8-15 |

1 | Peyman Bizargity | [27] |

2 | Gong Chen | [15] |

3 | Ömer Egecioglu | [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] |

4 | Dan He | [14] [16] [18] [19] [21] [23] [28] |

5 | Yu He | [15] [25] [28] |

6 | Alan C. H. Ling | [16] |

7 | Pavel A. Pevzner | [2] [3] |

8 | Xindong Wu | [15] [25] [28] |

9 | Elena Zheleva | [20] |

10 | Xingquan Zhu | [15] [25] |