C# Algorithm for Graph Comparison

I'm seeking an experienced C# developer to create a new algorithm for comparing two discrete data graphs. We're currently using a proprietary algorithm that inaccurately classifies similar graphs as nearly identical. The goal is to provide a comparison value of zero for identical graphs, with higher values for more differences.

Key Requirements:
- Graphs will be in dB and frequency linear
- Focus on shape similarity, frequency peak alignment, and amplitude correlation
- Aim for a balance between accuracy and computation speed

Ideal Skills and Experience:
- Proficiency in C# and algorithm development
- Background in signal processing or similar fields
- Experience with graph analysis and comparison techniques

Please provide a portfolio or examples of similar work.