The term "phylogenetic tree” is used in: | Agrigyan

• Personalized Medicine and Bioinformatics:
• Personalized (precision) medicine tailors disease prevention and healthcare interventions to an individual's unique genetic profile and molecular phenotype.
• Genome-Wide Association Studies (GWAS) scan whole genomes across patient cohorts to discover single-nucleotide polymorphisms (SNPs) and genetic variants associated with disease susceptibility, prognosis, and pharmacogenomic drug responses.
• Bioinformatics tools interpret GWAS loci to predict patient-specific drug efficacy and adverse drug reactions (ADRs).
• Wet-lab techniques like protein crystallization, virus isolation, and mRNA isolation are physical bench methods, not computational genomics applications.
• Conclusion: Genome-wide association studies (Option 1).

Correct option: (1) Genome-wide association studies

• Central Dogma of Molecular Biology:
• Articulated by Francis Crick (1958, 1970), the central dogma describes the sequential flow of detailed genetic information within a biological system:

• Genetic information stored in DNA is transcribed into messenger RNA (mRNA) by RNA polymerase, which is subsequently translated into polypeptides/proteins by ribosomes.
• Conclusion: DNA is transcribed into RNA, which is translated into proteins (Option 1).

Correct option: (1) DNAis transcribed into RNA, which is translated into proteins

• Definition of Homology in Computational Biology:
• In bioinformatics and evolutionary genetics, homology strictly means sharing common evolutionary ancestry between genes, proteins, or morphological structures.
• Homology is a qualitative attribute (sequences are either homologous or not homologous; they cannot be '80% homologous').
• Homologous genes are subdivided into:
• Orthologs: Homologs separated by a speciation event (often preserving function).
• Paralogs: Homologs arising from gene duplication events within a genome.
• Conclusion: Homology refers to Evolutionarily related genes or proteins (Option 3).

Correct option: (3) Evolutionarily related genes or proteins

• Sequence Alignment Algorithms:
• The Smith-Waterman algorithm (1981) is a dynamic programming algorithm used to compute mathematically optimal local sequence alignments between nucleotide or amino acid sequences.
• Needleman-Wunsch algorithm (1970) provides optimal global sequence alignments.
• Techniques such as PCR amplification, Southern blotting, and protein purification are laboratory bench procedures.
• Conclusion: The algorithm is the Smith-Waterman algorithm (Option 1).

Correct option: (1) Smith-Waterman algorithm