More posts like this
-
Question related to time complexity of Needleman-Wunsch Algorithm
written by shreya.verma808 •The time complexity of Needleman-Wunsch algorithm is O(m*n) for pairwise sequence alignment with one sequence of length m and another sequence of length n.For three …
-
Blast in Biopython
written by midoxhello, I have two sequences and i need to use Blast under Biopython to align these two sequences and retrieve the results in list for …
-
calculate the e-value of alignment
written by midoxhello, i used Biopython and i used the **pairwise2.align.localms** function of Smith-Waterman alignment. but in the output i have the score of alignment and i …
-
Using Standalone Blast In Biopython
written by midoxHello, i would like some help in using Blast in Biopython. Can you give me an example of using Blast in Biopython ? for example …
-
Blastp with blast+
written by Charlesologidi •Hello, I have been trying to run blastp on blast+ with 120 query sequences against Sorghum bicolor proteins. I created the database successful but I …
-
Reads Simulation and Read Simulator
written by midoxhello, Can you explain me what's a reads Simulation or Read Silulator? and what's the simulation data or Reads? Thanks
-
BLAST source code
written by arfaj a •Hello, I am developing a BLAST tool and I want the source code of BLASTN. Any help please? Thanks a lot
-
Blast converter Format Output
written by midoxHello, I have a Blast output format. I would like to convert this output format to the Format of Blast formatType=10. Is there a tool …
-
alignments of DNA sequences
written by midox<p>Hello,<br /> I have a long sequences file and another small sequences. I want to do an alignment (multiple or global) of small sequences on …
-
Window size and strigency in Dotplot
written by D H •Hello!! I'm trying to generate a dot plot for the alignment of two sequences. Can any one tell me what's the criterion to select window …
I think you would have to tell us more about what resources (computationally) you have available to you.
I'm talking about computational complexity. That is to say O (....)