FU Logo
  • Startseite
  • Kontakt
  • Impressum
  • Home
  • Listenauswahl
  • Anleitungen

[Seqan-dev] Longest common subsequence example

<-- thread -->
<-- date -->
  • From: Raymond Wan <rwan@cuhk.edu.hk>
  • To: seqan-dev@lists.fu-berlin.de
  • Date: Thu, 02 Feb 2012 11:52:57 +0800
  • Reply-to: SeqAn Development <seqan-dev@lists.fu-berlin.de>
  • Subject: [Seqan-dev] Longest common subsequence example

Hi all,

I'm trying to compile the longest common subsequence example from here:

http://docs.seqan.de/seqan/1.0/Demo_Longest%20Common%20Subsequence.html

And have been unsuccessful.  Seems the header file seqan/graph.h cannot be
found.  I guess this code is for an earlier version of SeqAn?  Can someone tell
me what I should be including or if the function has been removed?

Thank you!

Ray






-------------------------------------------------
This e-mail is sent by CUHK WebMail http://webmail.cuhk.edu.hk




<-- thread -->
<-- date -->
  • Follow-Ups:
    • Re: [Seqan-dev] Longest common subsequence example
      • From: Raymond Wan <rwan@cuhk.edu.hk>
  • seqan-dev - February 2012 - Archives indexes sorted by:
    [ thread ] [ subject ] [ author ] [ date ]
  • Complete archive of the seqan-dev mailing list
  • More info on this list...

Hilfe

  • FAQ
  • Dienstbeschreibung
  • ZEDAT Beratung
  • postmaster@lists.fu-berlin.de

Service-Navigation

  • Startseite
  • Listenauswahl

Einrichtung Mailingliste

  • ZEDAT-Portal
  • Mailinglisten Portal