Areas of consensus can be identified in these data structures using WebLogos. The Smith-Waterman algorithm assigns penalties to gaps between these data structures during matrix (15[1])scoring. Neighbor-joining is one method used to create trees from these data structures that do not abide by molecular clock theory. Popular formats used to store these data structures include (-5[1])PHYLIP and FASTA. (-5[1])(*) NCBI maintains a search tool comparing these data structures to a query named (-5[1])BLAST. These data structures became cheaper to obtain after the emergence of next-generation techniques. These data structures’ units are assigned one of four colors in techniques named Illumina and Sanger. For 10 points, name this data structure used to detail DNA nucleotide (0[1])order. (0[2])■END■