你能在带有子字符串比较的字符串列表上运行二进制搜索吗?

问题是我有一个大约80万个字符串元素的列表，并试图匹配字符串的子字符串。对，现在我正在通过穷举搜索(蛮力)来做，但这需要几个小时。我希望会有一个更快更优雅的方法

namespace Sorting_Program_Ver1_1
{
class Program
{
    static void Main(string[] args)
    {
        string[] tempStringArray; string[] dataStringArray; string[] dotdotStringArray;
        List<string> myList = new List<string>();
        List<string> twoDots = new List<string>();
        Console.WriteLine("Starting program - initialising variables");
        tempStringArray = File.ReadAllLines("C:''datadomains");
        int count = 0;
        for (int a = 0; a < tempStringArray.Length - 1; a++)
        {
            if (tempStringArray[a].Length > 0)
            {
                myList.Add(tempStringArray[a]);
            }
        }
        Console.WriteLine("Adding items to string list");
        for (int b = 0; b < myList.Count; b++)
        {
            for (int c = 0; c < myList[b].Length; c++)
            {
                if (myList[b][c] == '.')
                {
                    count++;
                }
            }
            if (count == 2)
            {
                twoDots.Add(myList[b]);
            }
            count = 0;
        }
        Console.WriteLine("Sorting the list into 2");
        dotdotStringArray = twoDots.ToArray();
        System.IO.File.WriteAllLines("C:''twoDots.txt", dotdotStringArray);
        Console.WriteLine("Starting the search...");
        for (int d = 0; d < twoDots.Count; d++)
        {
            for (int e = myList.Count - 1; e > 0; e--)
            {
                if (myList[e] == "")
                {
                    Console.WriteLine("Removing empty space...");
                    myList.RemoveAt(e);              
                }
                int start = myList[e].Length - twoDots[d].Length;
                if (start >= 0)
                {
                    if (twoDots[d] == myList[e].Substring(start, twoDots[d].Length))
                    {
                        if (twoDots[d] != twoDots[d])
                        {
                            Console.WriteLine("Removing...", myList[e]);
                            myList.RemoveAt(e);
                        }
                    }                       
                }
            }
        }
        Console.WriteLine("Saving to file ...");
        dataStringArray = myList.ToArray();
        System.IO.File.WriteAllLines("C:''myList.txt", dataStringArray);
        Console.WriteLine("Saved to file");
        Console.WriteLine("Exit program");
    }
}

}

的例子:

mylist[0]= ".bob.com"
mylist[1]= ".steve.bob.com"
mylist[2]= ".steve.job.bob.com"
...
mylist[800000]= ".coffee.com"
substring=".bob.com"

我试图通过列表和匹配字符串与子字符串和摆脱子域。这样更清楚了吗?