//http://rosalind.info/problems/ctbl/
public CreatingACharacterTable()
{
var tree = new NewickTree(File.ReadAllLines(@"C:\code\dataset.txt")[0]);
var lexList = new List <string>(tree.Nodes.Where(n => n.HasName).Select(n => n.Name));
lexList.Sort();
CharacterTable.WriteCharacterTable(tree.Nodes, lexList);
}
//http://rosalind.info/problems/cstr/
public CreatingACharacterTableFromGeneticStrings()
{
//This actually sorts the strings according to how they'd split if they were arranged like a trie
List <string> inputs = File.ReadAllLines(@"C:\code\dataset.txt").ToList();
Dictionary <KeyValuePair <int, int>, string> trie = Trie.GetTrie(inputs);
var lexList = new List <string>();
for (int i = 0; i < inputs.Count; i++)
{
lexList.Add(i.ToString());
}
var nodes = new List <TrieNode>();
int name = 0;
int max = trie.First().Key.Value;
bool passedFirst = false;
foreach (var item in trie)
{
int neighbours = trie.Count(t => t.Key.Key == item.Key.Value);
int value = item.Key.Key;
if (value < max)
{
if (passedFirst)
{
value = max;
}
passedFirst = true;
}
if (neighbours == 0)
{
nodes.Add(new TrieNode(item.Key.Value, value, name.ToString(), true));
name++;
}
else
{
nodes.Add(new TrieNode(item.Key.Value, value, "", neighbours != 2));
}
}
CharacterTable.WriteCharacterTable(nodes, lexList);
}