| Year |
Citation |
Score |
| 2016 |
Thankachan SV, Chockalingam SP, Liu Y, Apostolico A, Aluru S. ALFRED: A Practical Method for Alignment-Free Distance Computation. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. PMID 27138275 DOI: 10.1089/Cmb.2015.0217 |
0.391 |
|
| 2016 |
Thankachan SV, Apostolico A, Aluru S. A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. PMID 27058840 DOI: 10.1089/Cmb.2015.0235 |
0.477 |
|
| 2015 |
Amir A, Apostolico A, Hirst T, Landau GM, Lewenstein N, Rozenberg L. Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings Theoretical Computer Science. DOI: 10.1016/J.Tcs.2016.04.030 |
0.419 |
|
| 2015 |
Apostolico A, Guerra C, Landau GM, Pizzi C. Sequence similarity measures based on bounded hamming distance Theoretical Computer Science. DOI: 10.1016/J.Tcs.2016.01.023 |
0.414 |
|
| 2015 |
Amir A, Apostolico A, Landau GM, Porat E, Sar Shalom O. A PTAS for the Square Tiling Problem Theoretical Computer Science. 562: 33-45. DOI: 10.1016/J.Tcs.2014.09.012 |
0.336 |
|
| 2014 |
Apostolico A, Guerra C, Pizzi C. Alignment free sequence similarity with bounded hamming distance Data Compression Conference Proceedings. 183-192. DOI: 10.1109/DCC.2014.57 |
0.31 |
|
| 2014 |
Apostolico A, Erdos PL, Miklós I, Siemons J. Modulated string searching Theoretical Computer Science. 525: 23-29. DOI: 10.1016/J.Tcs.2013.10.013 |
0.421 |
|
| 2014 |
Amir A, Apostolico A, Eisenberg E, Landau GM, Levy A, Lewenstein N. Detecting approximate periodic patterns Theoretical Computer Science. 525: 60-67. DOI: 10.1016/J.Tcs.2013.05.001 |
0.474 |
|
| 2013 |
Apostolico A, Comin M, Dress A, Parida L. Ultrametric networks: a new tool for phylogenetic analysis. Algorithms For Molecular Biology : Amb. 8: 7. PMID 23497437 DOI: 10.1186/1748-7188-8-7 |
0.367 |
|
| 2012 |
Cunial F, Apostolico A. Phylogeny construction with rigid gapped motifs. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 19: 911-27. PMID 22731623 DOI: 10.1089/Cmb.2012.0060 |
0.363 |
|
| 2012 |
Apostolico A, Erds PL, Jüttner A. Parameterized searching with mismatches for run-length encoded strings Theoretical Computer Science. 454: 23-29. DOI: 10.1016/J.Tcs.2012.03.018 |
0.459 |
|
| 2012 |
Apostolico A, Erdos PL, Gyori E, Lipták Z, Pizzi C. Efficient algorithms for the periodic subgraphs mining problem Journal of Discrete Algorithms. 17: 24-30. DOI: 10.1016/J.Jda.2012.05.002 |
0.422 |
|
| 2011 |
Apostolico A, Pizzi C, Ukkonen E. Efficient algorithms for the discovery of gapped factors. Algorithms For Molecular Biology : Amb. 6: 5. PMID 21429203 DOI: 10.1186/1748-7188-6-5 |
0.421 |
|
| 2011 |
Apostolico A, Barbares M, Pizzi C. Speedup for a periodic subgraph miner Information Processing Letters. 111: 521-523. DOI: 10.1016/J.Ipl.2011.02.016 |
0.333 |
|
| 2010 |
Apostolico A, Comin M, Parida L. VARUN: discovering extensible motifs under saturation constraints. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 7: 752-26. PMID 21030741 DOI: 10.1109/Tcbb.2008.123 |
0.357 |
|
| 2010 |
Apostolico A, Tagliacollo C. Optimal extraction of irredundant motif bases International Journal of Foundations of Computer Science. 21: 1035-1047. DOI: 10.1142/S0129054110007714 |
0.473 |
|
| 2009 |
Na JC, Roh K, Apostolico A, Park K. Alignment of biological sequences with quality scores. International Journal of Bioinformatics Research and Applications. 5: 97-113. PMID 19136367 DOI: 10.1504/Ijbra.2009.022466 |
0.337 |
|
| 2009 |
Apostolico A, Drovandi G. Graph Compression by BFS Algorithms. 2: 1031-1044. DOI: 10.3390/A2031031 |
0.302 |
|
| 2009 |
Apostolico A, Cunial F. The subsequence composition of a string Theoretical Computer Science. 410: 4360-4371. DOI: 10.1016/J.Tcs.2009.07.017 |
0.395 |
|
| 2009 |
Apostolico A, Satta G. Discovering subword associations in strings in time linear in the output size Journal of Discrete Algorithms. 7: 227-238. DOI: 10.1016/J.Jda.2007.02.003 |
0.434 |
|
| 2008 |
Apostolico A, Denas O. Fast algorithms for computing sequence distances by exhaustive substring composition. Algorithms For Molecular Biology : Amb. 3: 13. PMID 18957094 DOI: 10.1186/1748-7188-3-13 |
0.4 |
|
| 2008 |
Apostolico A, Tagliacollo C. Incremental discovery of the irredundant motif bases for all suffixes of a string in O (n2 log n) time Theoretical Computer Science. 408: 106-115. DOI: 10.1016/J.Tcs.2008.08.002 |
0.469 |
|
| 2008 |
Apostolico A, Parida L, Rombo SE. Motif patterns in 2D Theoretical Computer Science. 390: 40-55. DOI: 10.1016/J.Tcs.2007.10.019 |
0.411 |
|
| 2008 |
Apostolico A, Pizzi C. Scoring Unusual Words with Varying Mismatch Errors Mathematics in Computer Science. 1: 639-653. DOI: 10.1007/S11786-007-0032-4 |
0.395 |
|
| 2007 |
Apostolico A. Fast gapped variants for Lempel-Ziv-Welch compression Information and Computation. 205: 1012-1026. DOI: 10.1016/J.Ic.2007.03.001 |
0.315 |
|
| 2007 |
Apostolico A, Pizzi C. Motif discovery by monotone scores Discrete Applied Mathematics. 155: 695-706. DOI: 10.1016/J.Dam.2005.09.017 |
0.399 |
|
| 2007 |
Apostolico A, Tagliacollo C. Optimal offline extraction of irredundant motif bases Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4598: 360-371. |
0.381 |
|
| 2006 |
Apostolico A, Comin M, Parida L. Mining, compressing and classifying with extensible motifs. Algorithms For Molecular Biology : Amb. 1: 4. PMID 16722593 DOI: 10.1186/1748-7188-1-4 |
0.361 |
|
| 2006 |
Apostolico A, Comin M, Parida L. Bridging lossy and lossless compression by motif pattern discovery Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4123: 793-813. DOI: 10.1016/J.Endm.2005.07.029 |
0.384 |
|
| 2005 |
Apostolico A, Comin M, Parida L. Conservative extraction of over-represented extensible motifs. Bioinformatics (Oxford, England). 21: i9-18. PMID 15961503 DOI: 10.1093/Bioinformatics/Bti1051 |
0.365 |
|
| 2004 |
Apostolico A, Parida L. Incremental paradigms of motif discovery. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 11: 15-25. PMID 15072686 DOI: 10.1089/106652704773416867 |
0.46 |
|
| 2004 |
Apostolico A, Gong FC, Lonardi S. Verbumculus and the discovery of unusual words Journal of Computer Science and Technology. 19: 22-41. DOI: 10.1007/Bf02944783 |
0.567 |
|
| 2004 |
Apostolico A, Pizzi C, Satta G. Optimal discovery of subword associations in strings (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3245: 270-277. |
0.306 |
|
| 2003 |
Apostolico A, Bock ME, Lonardi S. Monotony of surprise and large-scale quest for unusual words. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 10: 283-311. PMID 12935329 DOI: 10.1089/10665270360688020 |
0.607 |
|
| 2003 |
Amir A, Apostolico A, Landau GM, Satta G. Efficient text fingerprinting via parikh mapping Journal of Discrete Algorithms. 1: 409-421. DOI: 10.1016/S1570-8667(03)00035-2 |
0.429 |
|
| 2003 |
Na JC, Apostolico A, Iliopoulos CS, Park K. Truncated suffix trees and their application to data compression Theoretical Computer Science. 304: 87-101. DOI: 10.1016/S0304-3975(03)00053-7 |
0.4 |
|
| 2002 |
Apostolico A, Lonardi S. A speed-up for the commute between subword trees and DAWGs Information Processing Letters. 83: 159-161. DOI: 10.1016/S0020-0190(01)00327-1 |
0.551 |
|
| 2002 |
Apostolico A, Atallah MJ. Compact recognizers of episode sequences Information and Computation. 174: 180-192. DOI: 10.1006/Inco.2002.3143 |
0.418 |
|
| 2000 |
Apostolico A, Bejerano G. Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 7: 381-93. PMID 11108469 DOI: 10.1089/106652700750050844 |
0.383 |
|
| 2000 |
Apostolico A, Bock ME, Lonardi S, Xu X. Efficient detection of unusual words. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 7: 71-94. PMID 10890389 DOI: 10.1089/10665270050081397 |
0.619 |
|
| 2000 |
Apostolico A, Lonardi S. Off-line compression by greedy textual substitution Proceedings of the Ieee. 88: 1733-1744. DOI: 10.1109/5.892709 |
0.486 |
|
| 2000 |
Apostolico A, Brimkov VE. Fibonacci arrays and their two-dimensional repetitions Theoretical Computer Science. 237: 263-273. DOI: 10.1016/S0304-3975(98)00182-0 |
0.364 |
|
| 1999 |
Apostolico A, Landau GM, Skiena S. Matching for run-length encoded strings Journal of Complexity. 15: 4-16. DOI: 10.1006/Jcom.1998.0493 |
0.335 |
|
| 1998 |
Apostolico A, Giancarlo R. Sequence alignment in molecular biology. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 5: 173-96. PMID 9672827 DOI: 10.1089/Cmb.1998.5.173 |
0.382 |
|
| 1997 |
Apostolico A, Bock ME, Xu X. Annotated statistical indices for sequence analysis Sequence. 215-229. DOI: 10.1109/Sequen.1997.666917 |
0.427 |
|
| 1997 |
Amir A, Apostolico A, Lewenstein M. Inverse Pattern Matching Journal of Algorithms. 24: 325-339. DOI: 10.1006/Jagm.1996.0850 |
0.361 |
|
| 1996 |
Apostolico A, Breslauer D. An optimal O(log log n)-time parallel algorithm for detecting all squares in a string Siam Journal On Computing. 25: 1318-1331. DOI: 10.7146/Brics.V2I11.19514 |
0.434 |
|
| 1996 |
Apostolico A, Preparata FP. Data Structures and Algorithms for the String Statistics Problem Algorithmica (New York). 15: 481-494. DOI: 10.1007/Bf01955046 |
0.432 |
|
| 1995 |
Apostolico A, Breslauer D, Galil Z. Parallel detection of all palindromes in a string Theoretical Computer Science. 141: 163-173. DOI: 10.1016/0304-3975(94)00083-U |
0.452 |
|
| 1995 |
Apostolico A, Crochemore M. Fast parallel Lyndon factorization with applications Mathematical Systems Theory. 28: 89-108. DOI: 10.1007/Bf01191471 |
0.461 |
|
| 1994 |
Apostolico A, Italiano GF, Gambosi G, Talamo M. The Set Union Problem with Unlimited Backtracking Siam Journal On Computing. 23: 50-70. DOI: 10.1137/S0097539789173597 |
0.444 |
|
| 1994 |
Apostolico A. Guest editor's foreword special issue on string algorithmics and its applications Algorithmica. 12: 245-246. DOI: 10.1007/Bf01185426 |
0.335 |
|
| 1993 |
Apostolico A. Efficient CRCW-PRAM algorithms for universal substring searching Theoretical Computer Science. 108: 331-344. DOI: 10.1016/0304-3975(93)90197-2 |
0.398 |
|
| 1993 |
Apostolico A, Ehrenfeucht A. Efficient detection of quasiperiodicities in strings Theoretical Computer Science. 119: 247-265. DOI: 10.1016/0304-3975(93)90159-Q |
0.373 |
|
| 1993 |
Apostolico A, Atallah MJ, Hambrusch S. New clique and independent set algorithms for circle graphs. Discrete Applied Mathematics 36 (1992) 1-24 Discrete Applied Mathematics. 41: 179-180. DOI: 10.1016/0166-218X(93)90038-P |
0.35 |
|
| 1992 |
Apostolico A, Browne S, Guerra C. Fast linear-space computations of longest common subsequences Theoretical Computer Science. 92: 3-17. DOI: 10.1016/0304-3975(92)90132-Y |
0.315 |
|
| 1992 |
Apostolico A, Szpankowski W. Self-alignments in words and their applications Journal of Algorithms. 13: 446-467. DOI: 10.1016/0196-6774(92)90049-I |
0.437 |
|
| 1992 |
Apostolico A, Atallah MJ, Hambrusch SE. New clique and independent set algorithms for circle graphs Discrete Applied Mathematics. 36: 1-24. DOI: 10.1016/0166-218X(92)90200-T |
0.419 |
|
| 1992 |
Apostolico A. Optimal parallel detection of squares in strings Algorithmica. 8: 285-319. DOI: 10.1007/Bf01758848 |
0.461 |
|
| 1991 |
Apostolico A, Crochemore M. Optimal canonization of all substrings of a string Information and Computation. 95: 76-95. DOI: 10.1016/0890-5401(91)90016-U |
0.394 |
|
| 1991 |
Apostolico A, Farach M, Iliopoulos CS. Optimal superprimitivity testing for strings Information Processing Letters. 39: 17-20. DOI: 10.1016/0020-0190(91)90056-N |
0.39 |
|
| 1990 |
Apostolico A, Atallah MJ, Larmore LL, McFaddin S. Efficient Parallel Algorithms for String Editing and Related Problems Siam Journal On Computing. 19: 968-988. DOI: 10.1137/0219066 |
0.406 |
|
| 1988 |
Apostolico A, Iliopoulos C, Landau GM, Schieber B, Vishkin U. Parallel construction of a suffix tree with applications Algorithmica. 3: 347-365. DOI: 10.1007/Bf01762122 |
0.467 |
|
| 1987 |
Apostolico A. Remark on the HSUDU new algorithm for the longest common subsequence problem Information Processing Letters. 25: 235-236. DOI: 10.1016/0020-0190(87)90167-0 |
0.394 |
|
| 1987 |
Apostolico A, Hambrusch SE. Finding maximum cliques on circular-arc graphs Information Processing Letters. 26: 209-215. DOI: 10.1016/0020-0190(87)90007-X |
0.418 |
|
| 1987 |
Apostolico A, Guerra C. The longest common subsequence problem revisited Algorithmica. 2: 315-336. DOI: 10.1007/Bf01840365 |
0.46 |
|
| 1986 |
Apostolico A, Giancarlo R. The Boyer–Moore–Galil String Searching Strategies Revisited Siam Journal On Computing. 15: 98-105. DOI: 10.1137/0215007 |
0.414 |
|
| 1986 |
Apostolico A. Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings Information Processing Letters. 23: 63-69. DOI: 10.1016/0020-0190(86)90044-X |
0.382 |
|
| 1985 |
Apostolico A, Preparata FP. Structural properties of the string statistics problem Journal of Computer and System Sciences. 31: 394-411. DOI: 10.1016/0022-0000(85)90060-1 |
0.414 |
|
| 1985 |
Apostolico A, Guerra C. FAST LINEAR SPACE ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES Proceedings - Annual Allerton Conference On Communication, Control, and Computing. 76-84. |
0.32 |
|
| 1983 |
Apostolico A, Preparata FP. Optimal off-line detection of repetitions in a string Theoretical Computer Science. 22: 297-315. DOI: 10.1016/0304-3975(83)90109-3 |
0.45 |
|
| Show low-probability matches. |