default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLucian Ilie
Person information
- affiliation: University of Western Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j58]Seyedmohsen Hosseini, Geoffrey Brian Golding, Lucian Ilie
:
Seq-InSite: sequence supersedes structure for protein interaction site prediction. Bioinform. 40(1) (2024)- 2021
- [j57]Yiwei Li, Geoffrey Brian Golding, Lucian Ilie:
DELPHI: accurate deep ensemble model for protein interaction sites prediction. Bioinform. 37(7): 896-904 (2021) - [j56]Arnab Mallik, Lucian Ilie:
ALeS: adaptive-length spaced-seed design. Bioinform. 37(9): 1206-1210 (2021) - 2020
- [p4]Yiwei Li, Lucian Ilie:
Predicting Protein-Protein Interactions Using SPRINT. Protein-Protein Interaction Networks 2020: 1-11
2010 – 2019
- 2018
- [j55]Michael Molnar, Ehsan Haghshenas, Lucian Ilie:
SAGE2: parallel human genome assembly. Bioinform. 34(4): 678-680 (2018) - 2017
- [j54]Yiwei Li, Lucian Ilie:
SPRINT: ultrafast protein-protein interaction prediction of the entire human interactome. BMC Bioinform. 18(1): 485:1-485:11 (2017) - [j53]Nilesh Khiste, Lucian Ilie:
HISEA: HIerarchical SEed Aligner for PacBio data. BMC Bioinform. 18(1): 564:1-564:13 (2017) - 2016
- [r2]Lucian Ilie:
Regular Expression Matching. Encyclopedia of Algorithms 2016: 1812-1816 - 2015
- [j52]Michael Molnar, Lucian Ilie:
Correcting Illumina data. Briefings Bioinform. 16(4): 588-599 (2015) - [j51]Nilesh Khiste, Lucian Ilie:
E-MEM: efficient computation of maximal exact matches for very large genomes. Bioinform. 31(4): 509-514 (2015) - 2014
- [j50]Lucian Ilie, Bahlul Haider, Michael Molnar, Roberto Solis-Oba:
SAGE: String-overlap Assembly of GEnomes. BMC Bioinform. 15: 302 (2014) - 2013
- [j49]Lucian Ilie, Michael Molnar:
RACER: Rapid and accurate correction of errors in reads. Bioinform. 29(19): 2490-2493 (2013) - [j48]Lucian Ilie, Hamid Mohamadi, Geoffrey Brian Golding, William F. Smyth:
BOND: Basic OligoNucleotide Design. BMC Bioinform. 14: 69 (2013) - [j47]Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
Computing the Longest Previous Factor. Eur. J. Comb. 34(1): 15-26 (2013) - 2012
- [j46]Anisa Al-Hafeedh, Maxime Crochemore, Lucian Ilie, Evguenia Kopylova, William F. Smyth, German Tischler, Munina Yusufu:
A comparison of index-based lempel-Ziv LZ77 factorization algorithms. ACM Comput. Surv. 45(1): 5:1-5:17 (2012) - 2011
- [j45]Lucian Ilie, Farideh Fazayeli, Silvana Ilie:
HiTEC: accurate error correction in high-throughput sequencing data. Bioinform. 27(3): 295-302 (2011) - [j44]Matei David, Misko Dzamba, Dan Lister, Lucian Ilie, Michael Brudno:
SHRiMP2: Sensitive yet Practical Short Read Mapping. Bioinform. 27(7): 1011-1012 (2011) - [j43]Lucian Ilie, Silvana Ilie, Anahita Mansouri Bigvand:
SpEED: fast computation of sensitive spaced seeds. Bioinform. 27(17): 2433-2434 (2011) - [j42]Lucian Ilie, William F. Smyth:
Minimum Unique Substrings and Maximum Repeats. Fundam. Informaticae 110(1-4): 183-195 (2011) - [j41]Maxime Crochemore, Lucian Ilie, Liviu Tinta:
The "runs" conjecture. Theor. Comput. Sci. 412(27): 2931-2941 (2011) - 2010
- [j40]Lucian Ilie, Gonzalo Navarro, Liviu Tinta:
The longest common extension problem revisited and applications to approximate string searching. J. Discrete Algorithms 8(4): 418-428 (2010)
2000 – 2009
- 2009
- [j39]Lucian Ilie, Silvana Ilie:
Fast computation of neighbor seeds. Bioinform. 25(6): 822-823 (2009) - [j38]Maxime Crochemore, Lucian Ilie, Wojciech Rytter:
Repetitions in strings: Algorithms and combinatorics. Theor. Comput. Sci. 410(50): 5227-5235 (2009) - [c29]Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
LPF Computation Revisited. IWOCA 2009: 158-169 - [c28]Lucian Ilie, Liviu Tinta:
Practical Algorithms for the Longest Common Extension Problem. SPIRE 2009: 302-309 - 2008
- [j37]Maxime Crochemore, Lucian Ilie:
Computing Longest Previous Factor in linear time and applications. Inf. Process. Lett. 106(2): 75-80 (2008) - [j36]Maxime Crochemore, Lucian Ilie:
Maximal repetitions in strings. J. Comput. Syst. Sci. 74(5): 796-807 (2008) - [c27]Maxime Crochemore, Lucian Ilie, Liviu Tinta:
Towards a Solution to the "Runs" Conjecture. CPM 2008: 290-302 - [c26]Maxime Crochemore, Lucian Ilie, William F. Smyth:
A Simple Algorithm for Computing the Lempel Ziv Factorization. DCC 2008: 482-488 - [c25]Maxime Crochemore, Lucian Ilie:
Understanding Maximal Repetitions in Strings. STACS 2008: 11-16 - [r1]Lucian Ilie:
Regular Expression Matching. Encyclopedia of Algorithms 2008 - [i2]Maxime Crochemore, Lucian Ilie:
Understanding maximal repetitions in strings. CoRR abs/0802.2829 (2008) - 2007
- [j35]Lucian Ilie, Silvana Ilie:
Multiple spaced seeds for homology search. Bioinform. 23(22): 2969-2977 (2007) - [j34]Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi:
The Structure of Factor Oracles. Int. J. Found. Comput. Sci. 18(4): 781-797 (2007) - [j33]Sorin Constantinescu, Lucian Ilie:
The Lempel--Ziv Complexity of Fixed Points of Morphisms. SIAM J. Discret. Math. 21(2): 466-481 (2007) - [j32]Lucian Ilie:
A note on the number of squares in a word. Theor. Comput. Sci. 380(3): 373-376 (2007) - [c24]Lucian Ilie, Silvana Ilie:
Long spaced seeds for finding similarities between biological sequences. BIOCOMP 2007: 3-8 - [c23]Maxime Crochemore, Lucian Ilie:
Analysis of Maximal Repetitions in Strings. MFCS 2007: 465-476 - [c22]Lucian Ilie, Silvana Ilie:
Fast Computation of Good Multiple Spaced Seeds. WABI 2007: 346-358 - 2006
- [j31]Sorin Constantinescu, Lucian Ilie:
Fine and Wilf's Theorem for Abelian Periods. Bull. EATCS 89: 167-170 (2006) - [j30]Lucian Ilie, Cristian Popescu:
The Shortest Common Superstring Problem and Viral Genome Compression. Fundam. Informaticae 73(1-2): 153-164 (2006) - [j29]Lucian Ilie, Solomon Marcus, Ion Petre:
Periodic and Sturmian languages. Inf. Process. Lett. 98(6): 242-246 (2006) - [c21]Lucian Ilie, Roberto Solis-Oba:
Gene Assembly Algorithms for Ciliates. DNA 2006: 71-82 - [c20]Lucian Ilie, Liviu Tinta, Cristian Popescu, Kathleen A. Hill:
Viral Genome Compression. DNA 2006: 111-126 - [c19]Sorin Constantinescu, Lucian Ilie:
The Lempel-Ziv Complexity of Fixed Points of Morphisms. MFCS 2006: 280-291 - [c18]Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi:
Factor Oracles. CIAA 2006: 78-89 - [p3]Lucian Ilie:
Combinatorial Complexity Measures for Strings. Recent Advances in Formal Languages and Applications 2006: 149-170 - 2005
- [j28]Michael Davidson, Lucian Ilie:
Fast Data Compression with Antidictionaries. Fundam. Informaticae 64(1-4): 119-134 (2005) - [j27]Lucian Ilie:
A simple proof that a word of length n has at most 2n distinct squares. J. Comb. Theory A 112(1): 163-164 (2005) - [j26]Sorin Constantinescu, Lucian Ilie:
Generalised fine and Wilf's theorem for arbitrary number of periods. Theor. Comput. Sci. 339(1): 49-60 (2005) - [j25]Lucian Ilie, Pascal Ochem, Jeffrey O. Shallit:
A generalization of repetition threshold. Theor. Comput. Sci. 345(2-3): 359-369 (2005) - [c17]Lucian Ilie, Roberto Solis-Oba, Sheng Yu:
Reducing the Size of NFAs by Using Equivalences and Preorders. CPM 2005: 310-321 - 2004
- [j24]Lucian Ilie, Sheng Yu, Kaizhong Zhang:
Word Complexity And Repetitions In Words. Int. J. Found. Comput. Sci. 15(1): 41-55 (2004) - [c16]Lucian Ilie, Gonzalo Navarro, Sheng Yu:
On NFA Reductions. Theory Is Forever 2004: 112-124 - [c15]Lucian Ilie, Pascal Ochem, Jeffrey O. Shallit:
A Generalization of Repetition Threshold. MFCS 2004: 818-826 - [e1]Lucian Ilie, Detlef Wotschke:
6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26 - 28, 2004. Pre-proceedings. Department of Computer Science, The University of Western Ontario, Canada 2004, ISBN 0-7714-2506-6 [contents] - 2003
- [j23]Lucian Ilie, Sheng Yu:
Follow automata. Inf. Comput. 186(1): 140-162 (2003) - [j22]Lucian Ilie, Sheng Yu:
Reducing NFAs by invariant equivalences. Theor. Comput. Sci. 306(1-3): 373-390 (2003) - [c14]Lucian Ilie, Victor Mitrana:
Crossing-Over on Languages: A Formal Representation of Chromosomes Recombination. Grammars and Automata for String Processing 2003: 391-402 - [c13]Lucian Ilie, Sheng Yu, Qing Zhao:
Introduction to Process Traces. PDPTA 2003: 1706-1712 - [c12]Lucian Ilie, Baozhen Shan, Sheng Yu:
Fast Algorithms for Extended Regular Expression Matching and Searching. STACS 2003: 179-190 - [i1]Lucian Ilie, Jeffrey O. Shallit:
A Generalization of Repetition Threshold. CoRR math.CO/0310144 (2003) - 2002
- [c11]Lucian Ilie, Sheng Yu, Kaizhong Zhang:
Repetition Complexity of Words. COCOON 2002: 320-329 - [c10]Lucian Ilie, Sheng Yu:
Constructing NFA s by Optimal Use of Positions in Regular Expressions. CPM 2002: 279-288 - [c9]Lucian Ilie, Sheng Yu, Kaizhong Zhang:
Repetition Complexity of Words. DCFS 2002: 36 - [c8]Lucian Ilie, Sheng Yu:
Algorithms for Computing Small NFAs. MFCS 2002: 328-340 - 2001
- [c7]Lucian Ilie:
On Generalized Slenderness of Context-Free Languages. Words, Semigroups, and Transductions 2001: 189-202 - [c6]Tero Harju, Lucian Ilie:
Forbidden subsequences and permutations sortable on two parallel stacks. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 267-275 - 2000
- [j21]Lucian Ilie, Arto Salomaa:
On the Expressiveness of Subset-Sum Representations. Acta Informatica 36(8): 665-672 (2000) - [j20]Lucian Ilie, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
On strongly context-free languages. Discret. Appl. Math. 103(1-3): 153-165 (2000) - [j19]Lucian Ilie, Grzegorz Rozenberg, Arto Salomaa:
A characterization of poly-slender context-free languages. RAIRO Theor. Informatics Appl. 34(1): 77-86 (2000) - [j18]Lucian Ilie, Wojciech Plandowski:
Two-variable word equations. RAIRO Theor. Informatics Appl. 34(6): 467-501 (2000) - [j17]Vesa Halava, Tero Harju, Lucian Ilie:
Periods and Binary Words. J. Comb. Theory A 89(2): 298-303 (2000) - [j16]Lucian Ilie:
On lengths of words in context-free languages. Theor. Comput. Sci. 242(1-2): 327-359 (2000) - [c5]Lucian Ilie, Wojciech Plandowski:
Two-Variable Word Equations. STACS 2000: 122-132 - [p2]Lucian Ilie, Ion Petre, Grzegorz Rozenberg:
Uniformly Scattered Factors. Finite Versus Infinite 2000: 187-198
1990 – 1999
- 1999
- [j15]Lucian Ilie:
Subwords and Power-Free Words are not Expressible by Word Equations. Fundam. Informaticae 38(1-2): 109-118 (1999) - 1998
- [j14]Lucian Ilie:
Generalized Factors of Words. Fundam. Informaticae 33(3): 239-247 (1998) - [j13]Lucian Ilie, Arto Salomaa:
2-Testability and Relabelings Produce Everything. J. Comput. Syst. Sci. 56(3): 253-262 (1998) - [j12]Tero Harju, Lucian Ilie:
On Quasi Orders of Words and the Confluence Property. Theor. Comput. Sci. 200(1-2): 205-224 (1998) - [j11]Lucian Ilie, Arto Salomaa:
On Well Quasi Orders of Free Monoids. Theor. Comput. Sci. 204(1-2): 131-152 (1998) - 1997
- [j10]Lucian Ilie:
Some Recent Results on Contextual Languages. Bull. EATCS 62 (1997) - [j9]Lucian Ilie:
On the Computational Complexity of Marcus Contextual Languages. Fundam. Informaticae 30(2): 161-167 (1997) - [j8]Vesa Halava, Tero Harju, Lucian Ilie:
On a Geometric Problem of Zigzags. Inf. Process. Lett. 62(1): 1-4 (1997) - [j7]Tero Harju, Lucian Ilie:
Languages Obtained from Infinite Words. RAIRO Theor. Informatics Appl. 31(5): 445-455 (1997) - [j6]Lucian Ilie:
On Computational Complexity of Contextual Languages. Theor. Comput. Sci. 183(1): 33-44 (1997) - [c4]Lucian Ilie:
The Decidability of the Generalized Confluence Problem for Context-Free Languages. New Trends in Formal Languages 1997: 454-464 - [c3]Lucian Ilie:
Remarks on Well Quasi Orders of Words. Developments in Language Theory 1997: 399-409 - 1996
- [j5]Lucian Ilie, Arto Salomaa:
On Regular Characterizations of Languages by Grammar Systems. Acta Cybern. 12(4): 411-425 (1996) - [j4]Lucian Ilie:
Collapsing Hierarchies in PCGSs with Communication by Commands. Comput. Artif. Intell. 15(2-3): 173-184 (1996) - [j3]Lucian Ilie, Victor Mitrana:
Binary self-adding sequences and languages. Int. J. Comput. Math. 62(3-4): 171-181 (1996) - [c2]Lucian Ilie, Victor Mitrana:
Crossing-over on Languages. A Formal Representation of the Chromosome Recombination. German Conference on Bioinformatics 1996: 231-233 - 1995
- [j2]Lucian Ilie:
on Subwords of Infinite Words. Discret. Appl. Math. 63(3): 277-279 (1995) - [c1]Lucian Ilie:
On Disjunctivity, Ultimate Periodicity and Ultimate Identity. Developments in Language Theory 1995: 44-53 - 1994
- [j1]Lucian Ilie:
On a Conjecture about Slender Context-Free Languages. Theor. Comput. Sci. 132(2): 427-434 (1994) - [p1]Lucian Ilie:
On Contextual Grammars with Parallel Derivation. Mathematical Aspects of Natural and Formal Languages 1994: 165-172
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
