Announcement

Collapse
No announcement yet.

New Resources for 1000 Genomes

Collapse
This is a sticky topic.
X
X
 
  • Filter
  • Time
  • Show
Clear All
new posts

  • #31
    These two data sets represent our most recent set of alignments and the frozen alignments used for the phase1 analysis effort

    There will be overlapping individuals between the two sets but no bam files should be the same as an extended version of GRCh37 is being used for the post phase1 mapping

    see http://www.1000genomes.org/faq/which...bly-do-you-use

    You should be able to tell the difference between these files by the YYYYMMDD in their name as this points to the sequence index they were based on

    Comment


    • #32
      @papori I had the same issue. You can download the "sequence.index" file from the ftp site (ftp://ftp.1000genomes.ebi.ac.uk/vol1/ftp/). In Excel, I ended up making a new column where I divided BASE_COUNT by READ_COUNT. You can then filter the read length you are looking for.

      Comment


      • #33
        Please is there any one can help me how can I BLAST one FASTE file with more than 3000 sequences

        Comment


        • #34
          Mokhtar you would be better creating a new thread for your question, this isnt really related to the 1000 genomes project

          If you let people know what your sequences (dna, cdna, protein?) are and what species you are working in they will probably be able to offer better advice

          Comment


          • #35
            Please is there any one can help me how can I BLAST one FASTE file with more than 3000 DNA sequences generated from fungus community.

            Comment


            • #36
              Start a new thread, this is not the right place for this question

              Comment


              • #37
                A Fast Algorithm for th inexact Characteristic String Problem - Doubt

                Hi Guys,

                Fine?

                Has anyone read this article?
                Https://mediatum.ub.tum.de/doc/1094391/1094391.pdf

                I have question about ring buffer of this article...

                The page 11/12 the article explains for us that algorithm acess lines 14 and 15 of algorithm and posErr is with value k+1, but I was testing and the value is k and the algoritm Assumes negative values ​​for the ring buffer posErr....

                Can someone who knows this problem help me understand how to work with this ring buffer, or am I analyzing it wrong?

                Thanks

                Comment


                • #38
                  A relatively complete set of variant and other files associated.

                  Comment


                  • #39
                    the topic very good. Thanks bro

                    Comment

                    Working...
                    X