Lucian Ilie: Some of my recent papers
*
Bioinformatics
- L. Ilie, F. Fazayeli, and S. Ilie, HiTEC: accurate error correction in high-throughput sequencing data, Bioinformatics 2010; doi: 10.1093/bioinformatics/btq653 (pdf)
- L. Ilie and S. Ilie,
Fast computation of neighbor seeds, Bioinformatics
25(6) (2009) 822 -- 823. (pdf)
- L. Ilie and
S. Ilie, Multiple spaced seeds for homology search,
Bioinformatics
23
(22) (2007) 2969 -- 2977. (pdf)
- L. Ilie and
S. Ilie, Fast computation of multiple spaced seeds for homology search, in: R. Giancarlo, S. Hannenhalli, eds.,
Proc. of the 7th Workshop on Algorithms in Bioinformatics (WABI'07)
(Philadelphia, 2007), Lecture Notes in Bioinformatics
4645
, Springer, Berlin, 2007, 346–358.
- L. Ilie and
S. Ilie, Long spaced seeds for homology search, in: H. Arabnia, M.Q. Yang, and J.Y. Yang, eds.,
Proc. of the 2007 International Conference on Bioinformatics and Computational Biology (BIOCOMP'07)
(Las Vegas, 2007), Vol. I, CSREA Press, Las Vegas, 2007, 3 -- 8. (
pdf)
String algorithms
- M. Crochemore, L. Ilie, C. Iliopoulos, M. Kubica, W. Rytter, and T. Walen, LPF computation revisited, in: Proc. of 20th IWOCA, Lecture Notes in Comput.~Sci. 5874, Springer, Heidelberg, 2009, 158--169. (pdf)
- L. Ilie, G. Navarro, and L. Tinta, The Longest Common Extension problem revisited and an application to approximate string searching, Journal of Discrete Algorithms 8(4) (2010) 418 -- 428. (pdf)
-
M. Crochemore, L. Ilie, and
W. F. Smyth, A simple algorithm for computing the Lempel--Ziv factorization,
Proc. of 17th Data Compression Conference (DCC'08)
(Snowbird, Utah, USA), IEEE Computer Society, Los Alamitos, CA, 2008, 482 -- 488. (
pdf)
-
M. Crochemore and L. Ilie, Computing Longest Previous Factor in linear time and applications,
Inform. Proc. Lett.
106
(2008) 75 –- 80. (
pdf)
-
M. Crochemore, L. Ilie, and Emine Seid-Hilmi, The structure of factor oracles,
Internat. J. Found. Comput. Sci.
18
(4) (2007) 781 -- 797. (
pdf)
- L. Ilie,
R. Solis-Oba, and
S. Yu
, Reducing NFAs by equivalences and preorders, in: A. Apostolico, M. Crochemore, K. Park, eds.,
Proc. of 16th Annual Symposium on Combinatorial Pattern Matching (CPM'05)
(Jeju island, Korea, 2005), Lecture Notes in Comput. Sci.
3537,
Springer, Berlin, 2005, 310 -- 321. (
pdf)
-
L. Ilie,
G. Navarro, and
S. Yu
On NFA reductions, in: J. Karhumaki, H. Maurer, G. Paun, G.Rozenberg, eds.,
Theory is Forever
(Salomaa Festschrift), Lecture Notes in Comput. Sci. 3113, Springer-Verlag, Berlin, Heidelberg, 2004, 112 -- 124.
(
pdf)
-
L. Ilie and
S. Yu, Follow automata,
Inform. and Comput.
186 (1)) (2003) 1 -- 162.
(
pdf)
String combinatorics
- The "runs" conjecture -- latest results
-
M. Crochemore and L. Ilie, Maximal repetitions in strings,
J. Comput. Syst. Sci.
74
(2008) 796 –- 807. (pdf)
- L. Ilie, A simple proof that a word of length n has at most 2ndistinct squares,
J. Combin. Theory, Ser. A
,
112
(1) (2005) 163 -- 164. (
pdf)
-
L. Ilie,
P. Ochem, and
J. Shallit
,
A generalization ofrepetition threshold,
Theoret. Comput. Sci.
345
(2-3) (2005) 359 -- 369.
(
pdf
)
-
V. Halava,
T. Harju, and L. Ilie, Periods and binary words,
J.Combin.Theory, Ser. A,
89 (2000) 298 -- 308. (
pdf)
String complexity
-
S. Constantinescu
and L. Ilie, The Lempel--Ziv complexity of fixed points of morphisms,
SIAM J. Discrete Math.
21
(2) (2007) 466 -- 481. (
pdf)
-
L. Ilie,
S. Yu, and
K. Zhang
, Word complexity and repetitions in words,
Internat. J. Found. Comput. Sci.
15
(1) (2004) 41 -- 55.
(
pdf)
*The copyright belongs to thepublishers, so please use these files for your personal use only.