Travelled to:1 × Czech Republic
1 × Germany
1 × Japan
1 × Taiwan
2 × France
Collaborated with:M.Crochemore I.Jayasekera B.Melichar S.P.Pissis S.Z.Fazekas P.Antoniou P.Peterlongo C.Barton M.S.Rahman M.Vorácek L.Vagner J.Supol T.Flouri J.Janousek J.Holub M.Kubica J.Radoszewski W.Rytter T.Walen
Talks about:string (6) common (3) match (3) tree (3) automata (2) approxim (2) degener (2) number (2) power (2) motif (2)
Person: Costas S. Iliopoulos
DBLP: Iliopoulos:Costas_S=
Contributed to:
2015
20112010
20082010200720072006Wrote 9 papers:
- LATA-2015-BartonIP #approximate #string
- Average-Case Optimal Approximate Circular String Matching (CB, CSI, SPP), pp. 85–96.
- CIAA-2011-FlouriJMIP #automaton #order
- Tree Template Matching in Ranked Ordered Trees by Pushdown Automata (TF, JJ, BM, CSI, SPP), pp. 273–281.
- LATA-2010-CrochemoreIKRRW #on the #polynomial #string
- On the Maximal Number of Cubic Runs in a String (MC, CSI, MK, JR, WR, TW), pp. 227–238.
- DLT-2008-CrochemoreFIJ #bound #string
- Bounds on Powers in Strings (MC, SZF, CSI, IJ), pp. 206–215.
- DLT-J-2008-CrochemoreFIJ10 #string
- Number of Occurrences of powers in Strings (MC, SZF, CSI, IJ), pp. 535–547.
- CIAA-2007-IliopoulosRVV #problem #sequence #string
- The Constrained Longest Common Subsequence Problem for Degenerate Strings (CSI, MSR, MV, LV), pp. 309–311.
- LATA-2007-AntoniouCIP #set #string
- Application of suffix trees for the acquisition of common motifs with gaps in a set of strings (PA, MC, CSI, PP), pp. 57–66.
- LATA-2007-IliopoulosJMS #approximate #pattern matching
- Weighted Degenerated Approximate Pattern Matching (CSI, IJ, BM, JS), pp. 285–296.
- CIAA-2006-AntoniouHIMP #automaton #finite #using
- Finding Common Motifs with Gaps Using Finite Automata (PA, JH, CSI, BM, PP), pp. 69–77.