| 
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorigincomment.Matrice_ALN
public class Matrice_ALN
Alignment matrix...
Case| Field Summary | |
|---|---|
private  ADN1test | 
adncible
Target sequence in format of test sequence.  | 
private  java.util.Vector | 
alignements
Vector of alignments.  | 
private  int[] | 
courant
A current tab of integers.  | 
private static double | 
lmin
Lmin / minimal length.  | 
private  Case[][] | 
matrice
2D table (default is null).  | 
private static double[] | 
meilleurScore
Best score matrix.  | 
private  int | 
nb_alignements
Number of alignments.  | 
private  int | 
nb_alignements_trouves
Number of alignments found.  | 
private  int[] | 
position3prime
"bases postions of palindrome in test sequence" 3' side  | 
private  int[] | 
position5prime
"bases postions of palindrome in test sequence" 5' side  | 
private  java.lang.String | 
seq3prime
3' sequence (default is empty ("")).  | 
private  java.lang.String | 
seq5prime
5' sequence (default is empty ("")).  | 
private static int | 
taille3prime
Length on 3' side.  | 
private static int | 
taille5prime
Length on 5' side.  | 
| Constructor Summary | |
|---|---|
Matrice_ALN(ADN1test seqcible,
            ADN1test seqtest,
            int debut5,
            int fin5,
            int debut3,
            int fin3,
            int nbaln,
            double lgmin)
 | 
|
| Method Summary | |
|---|---|
private  void | 
aligner()
Local alignment (Smith and Waterman).  | 
private static double[] | 
calcul_score(int[] quelAln,
             Matrice_ALN[] tabMat)
Score computing ?  | 
static void | 
change_meilleur_score(double[] nvscore,
                      boolean forcage)
To set the best scores.  | 
private  void | 
chercher_meilleur()
Searching the best...  | 
private static void | 
choisi_aln(int[] quelAln,
           Matrice_ALN[] tabMat,
           int etape)
Alignment choice ?  | 
private static void | 
choisi_seq(Matrice_ALN[] tabMat,
           int[] quelleSeq,
           int etape,
           int debut)
Sequence choice ?  | 
private  void | 
initialiser()
Initialization of scoring matrix with new Cases, height and width +1 more than sequences.  | 
static double | 
meilleur_score(int i)
 | 
private  boolean | 
meilleur()
To get the best ??  | 
static void | 
meilleure_combinaison(Matrice_ALN[] tabMat,
                      int nbSeqTest,
                      int typeRecherche)
Best combination ?  | 
 int | 
quel_nombre_aln()
 | 
 Case | 
quelle_case()
 | 
 Case | 
quelle_case(int i,
            int j)
 | 
 java.lang.String | 
quelle_seq_3prime()
 | 
 java.lang.String | 
quelle_seq_5prime()
 | 
 java.util.Vector | 
quels_alignements()
 | 
private  void | 
recupere_alignement(Alignement align,
                    int[] courant,
                    int forcage)
To gain the alignment ?  | 
private  int[] | 
score(char x,
      char y)
Scoring a pairwise...  | 
 java.lang.String | 
toString()
 | 
| Methods inherited from class java.lang.Object | 
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait | 
| Field Detail | 
|---|
private static int taille5prime
private static int taille3prime
private static double[] meilleurScore
private static double lmin
private int nb_alignements
private Case[][] matrice
private int[] courant
private java.lang.String seq5prime
private java.lang.String seq3prime
private int[] position5prime
private int[] position3prime
private java.util.Vector alignements
private int nb_alignements_trouves
private ADN1test adncible
| Constructor Detail | 
|---|
public Matrice_ALN(ADN1test seqcible,
                   ADN1test seqtest,
                   int debut5,
                   int fin5,
                   int debut3,
                   int fin3,
                   int nbaln,
                   double lgmin)
seqcible - (ADN1test) target sequenceseqtest - (ADN1test) test sequencedebut5 - (int) begining of palindromefin5 - (int) (begin+length-) of palindromedebut3 - (int) end of palindromefin3 - (int) (end-length+1) of palindromenbaln - (int) number of alignment (1?)lgmin - (double) lmin [unused]TestAln.main(String[]), 
ADN1cible.verifier_Conservation_Alignement(Palindrome1cible, Palindrome1test, double, ADN1test[]), 
initialiser(), 
aligner(), 
chercher_meilleur()| Method Detail | 
|---|
public java.lang.String quelle_seq_5prime()
public java.lang.String quelle_seq_3prime()
public Case quelle_case()
public Case quelle_case(int i,
                        int j)
public int quel_nombre_aln()
public java.util.Vector quels_alignements()
public static double meilleur_score(int i)
public static void change_meilleur_score(double[] nvscore,
                                         boolean forcage)
nvscore - (double[])forcage - (boolean) true to be sure to change, else check if first score is better to set.choisi_aln(int[], Matrice_ALN[], int), 
ADN1cible.verifier_Conservation_Alignement(Palindrome1cible, Palindrome1test, double, ADN1test[])private void initialiser()
Matrice_ALN(ADN1test, ADN1test, int, int, int, int, int, double)private void aligner()
Matrice_ALN(ADN1test, ADN1test, int, int, int, int, int, double)
private int[] score(char x,
                    char y)
x - (char)y - (char)
aligner(), 
ADN1cible.score(char, char)private void chercher_meilleur()
Matrice_ALN(ADN1test, ADN1test, int, int, int, int, int, double), 
recupere_alignement(Alignement, int[], int), 
meilleur()
private void recupere_alignement(Alignement align,
                                 int[] courant,
                                 int forcage)
align - (Alignement)courant - (int[])forcage - (int) operationchercher_meilleur()private boolean meilleur()
chercher_meilleur()
public static void meilleure_combinaison(Matrice_ALN[] tabMat,
                                         int nbSeqTest,
                                         int typeRecherche)
tabMat - (Matrice_ALN[])nbSeqTest - (int)typeRecherche - (typoeRecherche)ADN1cible.verifier_Conservation_Alignement(Palindrome1cible, Palindrome1test, double, ADN1test[])
private static void choisi_aln(int[] quelAln,
                               Matrice_ALN[] tabMat,
                               int etape)
quelAln - (int[])tabMat - (Matrice_ALN[])etape - (int) stepmeilleure_combinaison(Matrice_ALN[], int, int), 
choisi_seq(Matrice_ALN[], int[], int, int), 
change_meilleur_score(double[], boolean)
private static void choisi_seq(Matrice_ALN[] tabMat,
                               int[] quelleSeq,
                               int etape,
                               int debut)
tabMat - (Matrice_ALN[])quelleSeq - (int[])etape - (int) stepdebut - (int) beginmeilleure_combinaison(Matrice_ALN[], int, int)
private static double[] calcul_score(int[] quelAln,
                                     Matrice_ALN[] tabMat)
quelAln - (int[])tabMat - (Matrice_ALN[])
choisi_aln(int[], Matrice_ALN[], int)public java.lang.String toString()
toString in class java.lang.Object
  | 
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||