BINC- BIOINFORMATICS QUESTION PAPER
Question # 1. How many edges meet at every branch node in a phylogenetic tree? A. 1 B. 2 C. 3 D. 4 Question # 2. What makes FASTA faster than NEEDLEMAN WUNSCH algorithm? A. The processor speed of the computer B. Hash table lookup C. Dynamic programming D. The scoring matrix used Question # 3. The […]
BINC- BIOINFORMATICS QUESTION PAPER Read More »