Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Arslan, Abdullah N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An algorithm with linear expected running time for string editing with substitutions and substring reversals
Abdullah N. Arslan
Information Processing Letters
106
(5), 2008, pp. 213-218
Algorithms for the constrained longest common subsequence problems
Abdullah N. Arslan
,
Ömer Eğecioğlu
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1099-1109
Regular expression constrained sequence alignment
Abdullah N. Arslan
Lecture Notes in Computer Science
3537
, 2005, pp. 322-333
Dictionary look-up within small edit distance
Abdullah N. Arslan
,
Ömer Eg̑eciog̑lu
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 57-71
Approximation algorithms for local alignment with length constraints
Abdullah N. Arslan
,
Ömer Eğecioğlu
International Journal of Foundations of Computer Science
13
(5), 2002, pp. 751-767
Dictionary look-up within small edit distance
Abdullah N. Arslan
,
Ömer Eğecioğlu
Lecture Notes in Computer Science
2387
, 2002, pp. 127-136
A new approach to sequence comparison: Normalized sequence alignment
Abdullah N. Arslan
,
Ömer Egecioglu
,
Pavel A. Pevzner
Bioinformatics
17
(4), 2001, pp. 327-337
A new approach to sequence comparison: Normalized sequence alignment
Abdullah N. Arslan
,
Ömer Eg̑eciog̑lu
,
Pavel A. Pevzner
Proceedings of the 5th Annual International Conference on Computational Molecular Biology, RECOMB'2001 (Montreal, Canada, April 22-25, 2001)
, 2001, pp. 2-11
An improved upper bound on the size of planar convex-hulls
Abdullah N. Arslan
,
Ömer Eğecioğlu
Lecture Notes in Computer Science
2108
, 2001, pp. 111-120