Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmihood Amir
Person information
- affiliation: Bar-Ilan University, Ramat Gan, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j100]Ora Amir, Amihood Amir
, Aviezri Fraenkel, David Sarne:
On the Practical Power of Automata in Pattern Matching. SN Comput. Sci. 5(4): 400 (2024)- [j99]Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Reconstructing parameterized strings from parameterized suffix and LCP arrays. Theor. Comput. Sci. 981: 114230 (2024) - [j98]Amihood Amir, Eitan Kondratovsky, Avivit Levy:
On suffix tree detection. Theor. Comput. Sci. 1012: 114728 (2024) - [c127]Amihood Amir, Michael Itzhaki:
Reconstructing General Matching Graphs. CPM 2024: 2:1-2:15 - [i20]Amihood Amir, Michael Itzhaki:
Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs. CoRR abs/2406.04507 (2024) - 2023
- [j97]Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Double String Tandem Repeats. Algorithmica 85(1): 170-187 (2023) - [c126]Amihood Amir, Eitan Kondratovsky, Avivit Levy:
On Suffix Tree Detection. SPIRE 2023: 14-27 - 2022
- [j96]Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol:
Multidimensional Period Recovery. Algorithmica 84(6): 1490-1510 (2022) - [c125]Amihood Amir, Concettina Guerra, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays. SPIRE 2022: 55-69 - [i19]Ora Amir, Amihood Amir, Aviezri Fraenkel, David Sarne:
On the Practical Power of Automata in Pattern Matching. CoRR abs/2207.08120 (2022) - 2021
- [j95]Amihood Amir, Eitan Kondratovsky:
Towards a real time algorithm for parameterized longest common prefix computation. Theor. Comput. Sci. 852: 132-137 (2021) - [c124]Amihood Amir, Itai Boneh, Eitan Kondratovsky:
The k-Mappability Problem Revisited. CPM 2021: 5:1-5:20 - [c123]Rami Cohen, Oren Sar Shalom, Dietmar Jannach, Amihood Amir:
A Black-Box Attack Model for Visually-Aware Recommender Systems. WSDM 2021: 94-102 - [i18]Amihood Amir, Itai Boneh, Eitan Kondratovsky:
The k-mappability problem revisited. CoRR abs/2106.07017 (2021) - [i17]Amihood Amir, Itai Boneh:
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time. CoRR abs/2112.12678 (2021) - 2020
- [j94]Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Dynamic and Internal Longest Common Substring. Algorithmica 82(12): 3707-3743 (2020) - [j93]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Online recognition of dictionary with one gap. Inf. Comput. 275: 104633 (2020) - [j92]Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Two-dimensional maximal repetitions. Theor. Comput. Sci. 812: 49-61 (2020) - [j91]Sung Gwan Park, Magsarjav Bataa, Amihood Amir, Gad M. Landau, Kunsoo Park:
Finding patterns and periods in Cartesian tree matching. Theor. Comput. Sci. 845: 181-197 (2020) - [c122]Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Double String Tandem Repeats. CPM 2020: 3:1-3:13 - [c121]Amihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky:
Analysis of the Period Recovery Error Bound. ESA 2020: 5:1-5:21 - [c120]Amihood Amir, Itai Boneh:
Update Query Time Trade-Off for Dynamic Suffix Arrays. ISAAC 2020: 63:1-63:16 - [c119]Amihood Amir, Itai Boneh, Eitan Kondratovsky:
Approximating the Anticover of a String. SPIRE 2020: 99-114 - [c118]Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol:
Multidimensional Period Recovery. SPIRE 2020: 115-130 - [c117]Ramtin Afshar, Amihood Amir, Michael T. Goodrich, Pedro Matias:
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction. SPIRE 2020: 155-174 - [i16]Amihood Amir, Itai Boneh:
Update Query Time Trade-off for dynamic Suffix Arrays. CoRR abs/2007.06604 (2020) - [i15]Ramtin Afshar, Amihood Amir, Michael T. Goodrich, Pedro Matias:
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors, and Jumbled-Index Queries in String Reconstruction. CoRR abs/2007.08787 (2020) - [i14]Rami Cohen, Oren Sar Shalom, Dietmar Jannach, Amihood Amir:
A Black-Box Attack Model for Visually-Aware Recommender Systems. CoRR abs/2011.02701 (2020)
2010 – 2019
- 2019
- [j90]Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom:
Mind the Gap! - Online Dictionary Matching with One Gap. Algorithmica 81(6): 2123-2157 (2019) - [j89]Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat:
Can We Recover the Cover? Algorithmica 81(7): 2857-2875 (2019) - [j88]Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat:
Approximate cover of strings. Theor. Comput. Sci. 793: 59-69 (2019) - [c116]Amihood Amir, Eitan Kondratovsky:
Sufficient Conditions for Efficient Indexing Under Different Matchings. CPM 2019: 6:1-6:12 - [c115]Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Cartesian Tree Matching and Indexing. CPM 2019: 16:1-16:14 - [c114]Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos, Eitan Kondratovsky:
Repetition Detection in a Dynamic String. ESA 2019: 5:1-5:18 - [c113]Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Substring Made Fully Dynamic. ESA 2019: 6:1-6:17 - [c112]Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Finding Periods in Cartesian Tree Matching. IWOCA 2019: 70-84 - [i13]Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Cartesian Tree Matching and Indexing. CoRR abs/1905.08974 (2019) - [i12]Amihood Amir, Itai Boneh:
Dynamic Palindrome Detection. CoRR abs/1906.09732 (2019) - 2018
- [j87]Xinrui Zhou, Amihood Amir, Concettina Guerra, Gad M. Landau, Jarek Rossignac:
EDoP Distance Between Sets of Incomplete Permutations: Application to Bacteria Classification Based on Gene Order. J. Comput. Biol. 25(11): 1193-1202 (2018) - [j86]Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol:
Period recovery of strings over the Hamming and edit distances. Theor. Comput. Sci. 710: 2-18 (2018) - [c111]Amihood Amir, Avivit Levy, Ely Porat:
Quasi-Periodicity Under Mismatch Errors. CPM 2018: 4:1-4:15 - [c110]Amihood Amir, Itai Boneh:
Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. CPM 2018: 11:1-11:13 - [c109]Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Two-Dimensional Maximal Repetitions. ESA 2018: 2:1-2:14 - [c108]Oren Sar Shalom, Haggai Roitman, Amihood Amir, Alexandros Karatzoglou:
Collaborative Filtering Method for Handling Diverse and Repetitive User-Item Interactions. HT 2018: 43-51 - [c107]Amihood Amir, Eitan Kondratovsky:
Searching for a Modified Pattern in a Changing Text. SPIRE 2018: 241-253 - [i11]Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Factor Made Fully Dynamic. CoRR abs/1804.08731 (2018) - 2017
- [j85]Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski:
Two strings at Hamming distance 1 cannot be both quasiperiodic. Inf. Process. Lett. 128: 54-57 (2017) - [j84]Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
On Representations of Ternary Order Relations in Numeric Strings. Math. Comput. Sci. 11(2): 127-136 (2017) - [j83]Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau:
String cadences. Theor. Comput. Sci. 698: 4-8 (2017) - [c106]Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat:
Can We Recover the Cover?. CPM 2017: 25:1-25:15 - [c105]Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat:
Approximate Cover of Strings. CPM 2017: 26:1-26:14 - [c104]Oren Sar Shalom, Haggai Roitman, Yishay Mansour, Amihood Amir:
A User Re-Modeling Approach to Item Recommendation using Complex Usage Data. ICTIR 2017: 201-208 - [c103]Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Factor After One Edit Operation. SPIRE 2017: 14-26 - [c102]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Online Recognition of Dictionary with One Gap. Stringology 2017: 3-17 - [i10]Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski:
Two strings at Hamming distance 1 cannot be both quasiperiodic. CoRR abs/1703.00195 (2017) - 2016
- [j82]Amihood Amir, Haim Paryenty, Liam Roditty:
Configurations and Minority in the String Consensus Problem. Algorithmica 74(4): 1267-1292 (2016) - [j81]Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings. Theor. Comput. Sci. 656: 146-159 (2016) - [c101]Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom:
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap. ISAAC 2016: 12:1-12:12 - [c100]Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol:
Period Recovery over the Hamming and Edit Distances. LATIN 2016: 55-67 - [c99]Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat:
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. SPAA 2016: 367-375 - [r6]Amihood Amir:
Multidimensional Compressed Pattern Matching. Encyclopedia of Algorithms 2016: 1366-1369 - [r5]Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Similarity Between Compressed Strings. Encyclopedia of Algorithms 2016: 1977-1981 - [r4]Amihood Amir:
Two-Dimensional Scaled Pattern Matching. Encyclopedia of Algorithms 2016: 2278-2282 - [i9]Amihood Amir, Alberto Apostolico, Travis Gagie, Gad M. Landau:
String Cadences. CoRR abs/1610.03337 (2016) - 2015
- [j80]Amihood Amir, Estrella Eisenberg, Avivit Levy:
Approximate periodicity. Inf. Comput. 241: 215-226 (2015) - [j79]Amihood Amir, Alberto Apostolico, Gad M. Landau, Ely Porat, Oren Sar Shalom:
A PTAS for the Square Tiling Problem. Theor. Comput. Sci. 562: 33-45 (2015) - [j78]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary matching with a few gaps. Theor. Comput. Sci. 589: 34-46 (2015) - [c98]Amihood Amir, Benny Porat:
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling. CPM 2015: 1-12 - [c97]Oren Sar Shalom, Shlomo Berkovsky, Royi Ronen, Elad Ziklik, Amihood Amir:
Data Quality Matters in Recommender Systems. RecSys 2015: 257-260 - [c96]Amihood Amir, Moshe Lewenstein, Sharma V. Thankachan:
Range LCP Queries Revisited. SPIRE 2015: 350-361 - [i8]Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom:
Online Dictionary Matching with One Gap. CoRR abs/1503.07563 (2015) - 2014
- [j77]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. J. Comput. Syst. Sci. 80(7): 1245-1253 (2014) - [j76]Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. SIAM J. Comput. 43(4): 1396-1416 (2014) - [j75]Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:
Detecting approximate periodic patterns. Theor. Comput. Sci. 525: 60-67 (2014) - [j74]Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein:
Closest periodic vectors in Lp spaces. Theor. Comput. Sci. 533: 26-36 (2014) - [c95]Amihood Amir, Moshe Lewenstein, Noa Lewenstein:
Hypertext Searching - A Survey. Language, Culture, Computation (1) 2014: 364-381 - [c94]Amihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom:
On the Efficiency of the Hamming C-Centerstring Problems. CPM 2014: 1-10 - [c93]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary Matching with One Gap. CPM 2014: 11-20 - [c92]Amihood Amir, Benny Porat:
Approximate On-line Palindrome Recognition, and Applications. CPM 2014: 21-29 - [c91]Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
On Representations of Ternary Order Relations in Numeric Strings. ICABD 2014: 46-52 - [c90]Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein:
On Hardness of Jumbled Indexing. ICALP (1) 2014: 114-125 - [c89]Amihood Amir, Jessica Ficler, Robert Krauthgamer, Liam Roditty, Oren Sar Shalom:
Multiply Balanced k -Partitioning. LATIN 2014: 586-597 - [c88]Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings. SPIRE 2014: 45-51 - [i7]Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein:
On Hardness of Jumbled Indexing. CoRR abs/1405.0189 (2014) - [i6]Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat:
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. CoRR abs/1408.2279 (2014) - [i5]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary Matching with One Gap. CoRR abs/1408.2350 (2014) - [i4]Amihood Amir, Oren Kapah, Ely Porat, Amir Rothschild:
Polynomials: a new tool for length reduction in binary discrete convolutions. CoRR abs/1410.5607 (2014) - 2013
- [j73]Amihood Amir, Haim Paryenty, Liam Roditty:
On the hardness of the Consensus String problem. Inf. Process. Lett. 113(10-11): 371-374 (2013) - [c87]Amihood Amir, Benny Porat:
Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms. ISAAC 2013: 55-65 - [i3]Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. CoRR abs/1306.0406 (2013) - 2012
- [j72]Amihood Amir, Laxmi Parida:
Combinatorial Pattern Matching (CPM 2010). Inf. Comput. 213: 1 (2012) - [j71]Amihood Amir, Haim Parienty:
Towards a theory of patches. J. Discrete Algorithms 12: 61-73 (2012) - [j70]Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira:
Cycle detection and correction. ACM Trans. Algorithms 9(1): 13:1-13:20 (2012) - [j69]Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko:
Quasi-distinct parsing and optimal compression methods. Theor. Comput. Sci. 422: 1-14 (2012) - [c86]Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:
Detecting Approximate Periodic Patterns. MedAlg 2012: 1-12 - [c85]Amihood Amir, Avivit Levy:
Approximate Period Detection and Correction. SPIRE 2012: 1-15 - [c84]Amihood Amir, Haim Paryenty, Liam Roditty:
Configurations and Minority in the String Consensus Problem. SPIRE 2012: 42-53 - 2011
- [j68]Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat:
Approximate string matching with stuck address bits. Theor. Comput. Sci. 412(29): 3537-3544 (2011) - [j67]Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theor. Comput. Sci. 412(39): 5239-5246 (2011) - [c83]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. ISAAC 2011: 683-692 - [c82]Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein:
Closest Periodic Vectors in L p Spaces. ISAAC 2011: 714-723 - [c81]Julio Ng, Amihood Amir, Pavel A. Pevzner:
Blocked Pattern Matching Problem and Its Applications in Proteomics. RECOMB 2011: 298-319 - [c80]Amihood Amir, Zvi Gotthilf, B. Riva Shalom:
Weighted Shortest Common Supersequence. SPIRE 2011: 44-54 - [c79]Amihood Amir, Haim Parienty, Liam Roditty:
Approximations and Partial Solutions for the Consensus Sequence Problem. SPIRE 2011: 168-173 - 2010
- [j66]Amihood Amir, Eran Chencinski:
Faster Two Dimensional Scaled Matching. Algorithmica 56(2): 214-234 (2010) - [j65]Amihood Amir, Zvi Gotthilf, B. Riva Shalom:
Weighted LCS. J. Discrete Algorithms 8(3): 273-281 (2010) - [c78]Amihood Amir, Avivit Levy:
String Rearrangement Metrics: A Survey. Algorithms and Applications 2010: 1-33 - [c77]Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira:
Cycle Detection and Correction. ICALP (1) 2010: 43-54 - [c76]Amihood Amir, Estrella Eisenberg, Avivit Levy:
Approximate Periodicity. ISAAC (1) 2010: 25-36 - [c75]Amihood Amir, Alberto Apostolico, Gad M. Landau, Oren Sar Shalom:
A PTAS for the Square Tiling Problem. SPIRE 2010: 118-126 - [c74]Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat:
Approximate String Matching with Stuck Address Bits. SPIRE 2010: 395-405 - [e3]Amihood Amir, Laxmi Parida:
Combinatorial Pattern Matching, 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings. Lecture Notes in Computer Science 6129, Springer 2010, ISBN 978-3-642-13508-8 [contents]
2000 – 2009
- 2009
- [j64]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat:
Real Two Dimensional Scaled Matching. Algorithmica 53(3): 314-336 (2009) - [j63]Amihood Amir, Gonzalo Navarro:
Parameterized matching on non-linear structures. Inf. Process. Lett. 109(15): 864-867 (2009) - [j62]Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne:
Pattern matching with address errors: Rearrangement distances. J. Comput. Syst. Sci. 75(6): 359-370 (2009) - [j61]Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat:
On the Cost of Interchange Rearrangement in Strings. SIAM J. Comput. 39(4): 1444-1461 (2009) - [j60]Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat:
Efficient computations of l1 and l∞ rearrangement distances. Theor. Comput. Sci. 410(43): 4382-4390 (2009) - [j59]Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate string matching with address bit errors. Theor. Comput. Sci. 410(51): 5334-5346 (2009) - [c73]Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko:
Quasi-distinct Parsing and Optimal Compression Methods. CPM 2009: 12-25 - [c72]Amihood Amir, Zvi Gotthilf, B. Riva Shalom:
Weighted LCS. IWOCA 2009: 36-47 - [c71]Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Consensus Optimizing Both Distance Sum and Radius. SPIRE 2009: 234-242 - [c70]Amihood Amir, Haim Parienty:
Towards a Theory of Patches. SPIRE 2009: 254-265 - 2008
- [j58]Amihood Amir, Avivit Levy, Liron Reuveni:
The Practical Efficiency of Convolutions in Pattern Matching Algorithms. Fundam. Informaticae 84(1): 1-15 (2008) - [j57]Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Computing similarity of run-length encoded strings with affine gap penalty. Theor. Comput. Sci. 395(2-3): 268-282 (2008) - [j56]Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang:
Property matching and weighted matching. Theor. Comput. Sci. 395(2-3): 298-310 (2008) - [j55]Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur:
Generalized LCS. Theor. Comput. Sci. 409(3): 438-449 (2008) - [c69]