/usr/lib/emboss/include/embnmer.h is in emboss-lib 6.6.0+dfsg-6.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 | /* @include embnmer ***********************************************************
**
** General routines for n-mer alignment.
**
** @author Copyright (c) 1999 Gary Williams
** @version $Revision: 1.8 $
** @modified $Date: 2011/10/18 14:24:25 $ by $Author: rice $
** @@
**
** This library is free software; you can redistribute it and/or
** modify it under the terms of the GNU Lesser General Public
** License as published by the Free Software Foundation; either
** version 2.1 of the License, or (at your option) any later version.
**
** This library is distributed in the hope that it will be useful,
** but WITHOUT ANY WARRANTY; without even the implied warranty of
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
** Lesser General Public License for more details.
**
** You should have received a copy of the GNU Lesser General Public
** License along with this library; if not, write to the Free Software
** Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
** MA 02110-1301, USA.
**
******************************************************************************/
#ifndef EMBNMER_H
#define EMBNMER_H
/*
* This set of routines was written primarily for the compseq program.
* Feel free to use it for anything you want.
*
* compseq counts the frequency of n-mers (or words) in a sequence.
*
* The easiest way to do this was to make a big ajulong array
* to hold the counts of each type of word.
*
* I needed a way of converting a sequence word into an integer so that I
* could increment the appropriate element of the array.
* (embNmerNuc2int and embNmerProt2int)
*
* I also needed a way of converting an integer back to a short sequence
* so that I could display the word.
* (embNmerInt2nuc and embNmerInt2prot)
*
* embNmerGetNoElements returns the number of elements required to store the
* results.
* In other words it is the number of possible words of size n.
*
* Gary Williams
*
*/
/* ========================================================================= */
/* ============================= include files ============================= */
/* ========================================================================= */
#include "ajdefine.h"
#include "ajstr.h"
AJ_BEGIN_DECLS
/* ========================================================================= */
/* =============================== constants =============================== */
/* ========================================================================= */
/* ========================================================================= */
/* ============================== public data ============================== */
/* ========================================================================= */
/* ========================================================================= */
/* =========================== public functions ============================ */
/* ========================================================================= */
/*
** Prototype definitions
*/
ajulong embNmerNuc2int (const char *seq, ajint wordsize, ajint offset,
AjBool *otherflag);
ajint embNmerInt2nuc (AjPStr *seq, ajint wordsize,
ajulong value);
ajulong embNmerProt2int (const char *seq, ajint wordsize, ajint offset,
AjBool *otherflag, AjBool ignorebz);
ajint embNmerInt2prot (AjPStr *seq, ajint wordsize,
ajulong value, AjBool ignorebz);
AjBool embNmerGetNoElements (ajulong *no_elements,
ajint word, AjBool seqisnuc,
AjBool ignorebz);
/*
** End of prototype definitions
*/
AJ_END_DECLS
#endif /* !EMBNMER_H */
|