# Amihood Amir

> Professor of Computer Science

**Wikidata**: [Q6603448](https://www.wikidata.org/wiki/Q6603448)  
**Source**: https://4ort.xyz/entity/amihood-amir

## Summary  
Amihood Amir is an Israeli computer scientist and professor known for his foundational contributions to string matching algorithms and computational biology. He has held a long-standing academic position at Bar-Ilan University and has advised numerous researchers who have gone on to prominent roles in academia and industry.

## Biography  
- Born: 1956  
- Nationality: Israel  
- Education: Ph.D. in Computer Science from Bar-Ilan University  
- Known for: Research in string algorithms, pattern matching, and applications in computational biology  
- Employer(s): Bar-Ilan University  
- Field(s): Computer Science, Artificial Intelligence  

## Contributions  
Amihood Amir has made significant contributions to theoretical computer science, particularly in the area of string algorithms and pattern matching. His research has had a strong impact on both theoretical foundations and practical applications, especially in computational biology.

Among his key works:
- Co-developed efficient algorithms for **swap matching** and **parameterized matching**, which extend classical pattern matching models.
- Authored influential papers such as *“Pattern Matching with swaps”* (1997) and *“Parameterized matching: Solutions and extensions”* (1998), widely cited in algorithmic literature.
- Pioneered work integrating combinatorial pattern matching with biological sequence analysis, contributing tools and methods used in genome analysis.
- Supervised doctoral students including Moshe Lewenstein, Martin Farach-Colton, and Ely Porat, many of whom became leading figures in computer science.

His research has been published in top-tier journals and conferences and continues to influence ongoing developments in algorithm design and bioinformatics.

## FAQs  
### Q: What is Amihood Amir known for?  
A: Amihood Amir is best known for his work in string algorithms and pattern matching, particularly in developing efficient solutions for complex matching problems like swap matching and parameterized matching.

### Q: Where does Amihood Amir work?  
A: He is a professor at Bar-Ilan University in Israel, where he has spent much of his academic career.

### Q: Who did Amihood Amir advise during his academic career?  
A: Amir supervised several notable doctoral students, including Moshe Lewenstein, Martin Farach-Colton, Ely Porat, and Avivit Levy, all of whom have made significant contributions to computer science.

## Why They Matter  
Amihood Amir’s work laid critical groundwork in the field of string algorithms, influencing how computers process and analyze sequences efficiently. His innovations in pattern matching underlie modern applications in text processing, data mining, and especially computational biology, where rapid comparison of genetic sequences is essential.

By advancing theoretical models—such as swap matching and parameterized matching—he enabled more flexible and powerful search capabilities that are now integral to various domains. Additionally, through his mentorship, he has shaped the next generation of algorithm researchers, extending his influence beyond direct research outputs into broader academic culture.

Without Amir’s contributions, progress in areas requiring high-performance pattern recognition might have developed more slowly, underscoring his lasting importance in theoretical and applied computing.

## Notable For  
- Developing novel string matching algorithms including swap and parameterized matching techniques  
- Advising multiple internationally recognized computer scientists and researchers  
- Publishing highly cited works in top theoretical computer science venues  
- Longstanding affiliation with Bar-Ilan University as a professor and researcher  
- Contributions bridging computer science theory with computational biology applications  

## Body  
### Academic Career  
Amihood Amir earned his doctorate in Computer Science from Bar-Ilan University, where he later became a faculty member. His academic lineage traces back to Dov Gabbay, a renowned logician and computer scientist based in the UK.

He has remained affiliated with Bar-Ilan throughout his career, serving as a central figure in its Department of Computer Science. His teaching and mentoring have produced graduates active in universities and tech industries worldwide.

### Research Focus  
Amir's early focus was on combinatorial pattern matching, specifically addressing non-standard forms of pattern matching such as:
- Swap matching – allowing mismatches caused by swapping adjacent characters
- Parameterized matching – matching strings when variables can represent consistent but unknown mappings

These models expanded traditional exact and approximate matching frameworks and found use in fields like image processing and software engineering.

Later, he turned toward applying these ideas in computational biology, working on algorithms for comparing biological sequences—an area requiring both speed and precision.

### Publications and Impact  
Amir co-authored seminal papers including:
- “Pattern Matching with Swaps” (1997) – introduced an efficient solution for swapped-character pattern searches
- “Parameterized Matching: Solutions and Extensions” (1998) – formalized and extended parameterized pattern matching models

His work appears regularly in premier venues such as SODA, FOCS, and journals like *Algorithmica* and *SIAM Journal on Computing*. These publications continue to be referenced in current algorithmic research.

### Mentorship Legacy  
Through his role as doctoral advisor, Amir helped launch the careers of several leaders in computer science:
- Moshe Lewenstein – expert in algorithms and data structures
- Martin Farach-Colton – known for suffix trees and cache-oblivious algorithms
- Ely Porat – prominent in streaming algorithms and property testing
- Avivit Levy – interdisciplinary scholar combining poetry/composition with CS

This legacy reflects his deep commitment to education and scholarly development within the global computer science community.

## Schema Markup  
```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Amihood Amir",
  "jobTitle": "Professor of Computer Science",
  "worksFor": {
    "@type": "Organization",
    "name": "Bar-Ilan University"
  },
  "nationality": {
    "@type": "Country",
    "name": "Israel"
  },
  "birthDate": "1956",
  "alumniOf": [
    {
      "@type": "EducationalOrganization",
      "name": "Bar-Ilan University"
    }
  ],
  "knowsAbout": ["Computer Science", "String Algorithms", "Pattern Matching", "Computational Biology"],
  "sameAs": [
    "http://www.wikidata.org/entity/Q13219454",
    "https://he.wikipedia.org/wiki/עמיהוד_אמיר"
  ],
  "description": "Israeli computer scientist and professor known for foundational work in string algorithms and pattern matching."
}

## References

1. IdRef
2. [Mathematics Genealogy Project](https://www.genealogy.math.ndsu.nodak.edu/id.php?id=70211)
3. [The Academic Family Tree](https://academictree.org/chemistry/peopleinfo.php?pid=744162)
4. Mathematics Genealogy Project
5. CiNii Research