Fork me on GitHub

Using multiple sequence alignments in social networks

Here’s a thought that first came to my head towards the end of last year, and I almost forgot about it, but Euan’s post where he asks “Don’t know if there are any other bioinformatics algorithms that have been applied to non-biological problems?” and my own recent discoveries about spam and bioinformatics re-kindled some thoughts, so here is a quick screencast on using multiple sequence alignment (as an illustration) for finding people in social networks.



The general idea is to use substitution matrices for an alphabet where each letter of the alphabet can be assigned some property of interest, e.g. favorite music type.

Crude, but worth a thought.

Technorati Tags: , ,

This entry was posted in Informatics, Multimedia, Social Networking. Bookmark the permalink. Post a comment or leave a trackback: Trackback URL.

4 Comments

  1. Posted January 25, 2008 at 22:54 | Permalink

    I’d say that strictly speaking, there is no such thing as a “bioinformatics algorithm”. There are only algorithms, some of which have found application in bioinformatics. The oft-quoted BLAST algorithm, for instance, is an approximation of Smith-Waterman, which is a variation of Needleman-Wunsch and all of them are based in dynamic programming methods. You might say that they align characters in a pair of strings – which just happens to be applicable to biological sequences. Look also at the many statistical methods in bioinformatics – SVMs, HMMs, various kinds of discrimination analysis – they all had their roots elsewhere.

    I think you still have an interesting question though – do methods commonly associated with bioinformatics have other uses?

    Feeling tired and pedantic today…

  2. Posted January 26, 2008 at 00:54 | Permalink

    I'd say that strictly speaking, there is no such thing as a “bioinformatics algorithm”. There are only algorithms, some of which have found application in bioinformatics. The oft-quoted BLAST algorithm, for instance, is an approximation of Smith-Waterman, which is a variation of Needleman-Wunsch and all of them are based in dynamic programming methods. You might say that they align characters in a pair of strings – which just happens to be applicable to biological sequences. Look also at the many statistical methods in bioinformatics – SVMs, HMMs, various kinds of discrimination analysis – they all had their roots elsewhere.

    I think you still have an interesting question though – do methods commonly associated with bioinformatics have other uses?

    Feeling tired and pedantic today…

  3. Posted January 26, 2008 at 00:49 | Permalink

    Neil

    You’re quite right. Should have said something like methods commonly used in Bioinformatics or something. Having written my share of dynamic programming algos that was a little sloppy on my part. The question remains. Do methods/techniques commonly used in the bioinformatics realm have applications in other areas.

  4. Posted January 26, 2008 at 02:49 | Permalink

    Neil

    You're quite right. Should have said something like methods commonly used in Bioinformatics or something. Having written my share of dynamic programming algos that was a little sloppy on my part. The question remains. Do methods/techniques commonly used in the bioinformatics realm have applications in other areas.

Post a Comment

Your email is never published nor shared. Required fields are marked *

*
*

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>

blog comments powered by Disqus
  • Archives

  • Disclaimer

    All opinions on this blog are my own and do not reflect those of my employers, past or present